Search results for "minimize"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
41		The Path Choice to Minimize the Project Risk Based on the Possible Degree.	IFITA (3)	2009	DBLP DOI BibTeX RDF	Cobb-Douglas production function, possible degree, the path of the project, minimize the risk
29	Ronald P. Bianchini Jr., Richard W. Buskens	Implementation of On-Line Distributed System-Level Diagnosis Theory.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	online distributed system-level diagnosis theory, distributed diagnosis algorithms, real systems, Adaptive DSD, faulty, fault situation, fault-free node, fault conditions, parallel algorithms, fault tolerant computing, distributed processing, multiprocessor interconnection networks, minimize, distributed network, network resources, network nodes
29	Ashok K. Agrawala, Edward G. Coffman Jr., M. R. Garey, Satish K. Tripathi	A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors.	IEEE Trans. Computers	1984	DBLP DOI BibTeX RDF	uniform processor systems, Consider a set of processors P1, ..., Pm differing only in speed and a set of jobs with exponentially distributed execution times, The rate parameter for the ith processor is given by ?i, 1 =i = m, where we assume the processors are ordered so that ?1 = ?2 = ... = ?m. The problem is to sequence the jobs nonpreemptively so as to minimize expected total flow time (sum of finishing times). We defin, Mean flow time minimization, stochastic optimization, stochastic scheduling, routing problems
29	Dhiraj K. Pradhan	Sequential Network Design Using Extra Inputs for Fault Detection.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	In order to enhance fault-detection capability, extra inputs are used when designing sequential machines, Here, a technique is proposed that designs these machines, precisely with the use of extra inputs?so as especially to minimize the length of the checking sequence, The resulting checking sequences are shown to be upper bounded by (3 + 2n)m+rn(3m + 1), where n is the number of states, r is the number of inputs, m = logs, n and s is the number of extra inputs, respectively., diameter of graphs, fault detection, directed graphs, sequential machine, distinguishing sequence, Checking sequence
22	Kan Watanabe, Masaru Fukushi, Susumu Horiguchi	Optimal spot-checking to minimize the computation time in volunteer computing.	IPDPS	2008	DBLP DOI BibTeX RDF
22	Nikhil Jayakumar, Sunil P. Khatri	An algorithm to minimize leakage through simultaneous input vector control and circuit modification.	DATE	2007	DBLP DOI BibTeX RDF
22	Sashka Davis, Jeff Edmonds, Russell Impagliazzo	Online Algorithms to Minimize Resource Reallocations and Network Communication.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
22	Anupam Gupta 0001, Bruce M. Maggs, Florian Oprea, Michael K. Reiter	Quorum placement in networks to minimize access delays.	PODC	2005	DBLP DOI BibTeX RDF	approximation algorithms, location, quorum systems, problems, LP rounding
22	Xin Yuan, Amit Fulay	A Wavelength Assignment Heuristic to Minimize SONET ADMs in WDM Rings.	ICPP Workshops	2001	DBLP DOI BibTeX RDF
18	Rajiv Gandhi, Julián Mestre	Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.	Algorithmica	2009	DBLP DOI BibTeX RDF	Min-sum scheduling problems, Approximation algorithms, Primal-dual algorithms
18	Xiaoqiang Cai, Xianyi Wu, Xian Zhou 0002	Stochastic scheduling on parallel machines to minimize discounted holding costs.	J. Sched.	2009	DBLP DOI BibTeX RDF	Discounted holding cost, Discounted rewords, Flowtime, Dynamic policy, Static list policy, SEPT rule, LEPT rule, Parallel machines, Makespan, Stochastic scheduling
18	Dukgwon Lee, Seunghyun Beak, Youngmin Lee, Eunser Lee, Jungkook Kim, Gyung-Leen Park, Taikyeong Jeong	Minimize the delay of parasitic capacitance and modeling in RLC circuit.	ICHIT	2009	DBLP DOI BibTeX RDF	Elmore, parasitic capacitance, delay, interconnection, oscillator
18	Meikang Qiu, Laurence Tianruo Yang, Edwin Hsing-Mean Sha	Rotation Scheduling and Voltage Assignment to Minimize Energy for SoC.	CSE (2)	2009	DBLP DOI BibTeX RDF
18	Sanjida Moury, Mohammad Tariq Iqbal	A new approach to minimize the cogging torque of axial flux pmg for under water applications.	CCECE	2009	DBLP DOI BibTeX RDF
18	Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer	Locating Facilities on a Network to Minimize Their Average Service Radius.	ISAAC	2007	DBLP DOI BibTeX RDF	Graph radius, Graph treewidth, NP-hardness, Graph partition, Facility location problems
18	Luis Diego Briceno, Mohana Oltikar, Howard Jay Siegel, Anthony A. Maciejewski	Study of an Iterative Technique to Minimize Completion Times of Non-Makespan Machines.	IPDPS	2007	DBLP DOI BibTeX RDF
18	Wei-Ting Yen, Shih-Hsu Huang, Chun-Hua Cheng	Simultaneous Operation Scheduling and Operation Delay Selection to Minimize Cycle-by-Cycle Power Differential.	EUC Workshops	2007	DBLP DOI BibTeX RDF	Cycle-by-cycle Power Differential, Low Power, High-Level Synthesis, Integer Linear Programming, Operation Scheduling, Data-Path Synthesis
18	Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam	Scheduling to minimize gaps and power consumption.	SPAA	2007	DBLP DOI BibTeX RDF	sleep state, multiprocessor scheduling, power minimization
18	JongSeob Baek, Sungwoo Park, Jong-Soo Seo	Novel Techniques to minimize the Error Propagation of Decision Feedback Equalizer in 8VSB DTV System.	VTC Spring	2006	DBLP DOI BibTeX RDF
18	Rajiv Gandhi, Julián Mestre	Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
18	Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos	Geometric Clustering to Minimize the Sum of Cluster Sizes.	ESA	2005	DBLP DOI BibTeX RDF
18	Kevin M. Taaffe, Deepak Tirumalasetty	Identifying demand sources that minimize risk for a selective newsvendor.	WSC	2005	DBLP DOI BibTeX RDF
18	Seon Ho Kim	Bulk Prefetching With Deadline-Driven Scheduling To Minimize Startup Latency Of Continuous Media Servers.	ICME	2001	DBLP DOI BibTeX RDF
18	Joshua Gluckman, Shree K. Nayar	Rectifying Transformations That Minimize Resampling Effects.	CVPR (1)	2001	DBLP DOI BibTeX RDF
18	Lamia Labed Jilani, Jules Desharnais, Marc Frappier, Rym Mili, Ali Mili 0001	Retrieving Software Components that Minimize Adaptation Effort.	ASE	1997	DBLP DOI BibTeX RDF	adaptation effort, retrieval procedures, approximate retrieval, library components, functional distance, formal specification, formal specifications, software components, software library
15	Zbysek Gajda, Lukás Sekanina	When does Cartesian genetic programming minimize the phenotype size implicitly?	GECCO	2010	DBLP DOI BibTeX RDF	genetic programming, digital circuits, evolutionary design
15	Jaynarayan T. Tudu, Erik Larsson, Virendra Singh, Hideo Fujiwara	Graph theoretic approach for scan cell reordering to minimize peak shift power.	ACM Great Lakes Symposium on VLSI	2010	DBLP DOI BibTeX RDF	power droop, scan chain reordering, peak power
15	Erik D. Demaine, Morteza Zadimoghaddam	Scheduling to minimize power consumption using submodular functions.	SPAA	2010	DBLP DOI BibTeX RDF	pre-emptive scheduling, sleep state, approximation algorithms, multiprocessor scheduling
15	Ruyan Fu, Ji Tian, Jinjiang Yuan	On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.	J. Sched.	2009	DBLP DOI BibTeX RDF	Job families, Competitive ratio, On-line scheduling, Batch machine
15	Fernando Parra, Sebastián García Galán, Antonio J. Yuste, Rocío Pérez de Prado, J. Enrique Muñoz Expósito	A Method to Minimize Distributed PSO Algorithm Execution Time in Grid Computer Environment.	IWINAC (2)	2009	DBLP DOI BibTeX RDF
15	Fernando Mateo, Dusan Sovilj, Rafael Gadea Gironés, Amaury Lendasse	RCGA-S/RCGA-SP Methods to Minimize the Delta Test for Regression Tasks.	IWANN (1)	2009	DBLP DOI BibTeX RDF	delta test, input scaling, input projection, variable selection, real-coded genetic algorithm, global search
15	Yuzhong Zhang, Jianfeng Ren, Chengfei Wang	Scheduling with Rejection to Minimize the Makespan.	COCOA	2009	DBLP DOI BibTeX RDF	scheduling with rejection, worst case performance ratio, Approximation algorithm, dynamic programming
15	Eric Torng, Jason McCullough	SRPT optimally utilizes faster machines to minimize flow time.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	scheduling, parallel machines, resource augmentation, flow time, SRPT
15	C. H. Lau, Boon-Hee Soong, S. K. Bose	Preemption With Rerouting to Minimize Service Disruption in Connection-Oriented Networks.	IEEE Trans. Syst. Man Cybern. Part A	2008	DBLP DOI BibTeX RDF
15	Yuzhong Zhang, Zhigang Cao 0002	An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Non-identical job sizes, Asymptotic PTAS, Scheduling, Makespan, Batching
15	Hans Vandierendonck, Koen De Bosschere	Constructing Optimal XOR-Functions to Minimize Cache Conflict Misses.	ARCS	2008	DBLP DOI BibTeX RDF
15	Mohammad Sharifi, Masarat Ayat, Shamsul Sahibuddin	Implementing ITIL-Based CMDB in the Organizations to Minimize or Remove Service Quality Gaps.	Asia International Conference on Modelling and Simulation	2008	DBLP DOI BibTeX RDF	CMDB, Service Quality, ITIL, Gap
15	Javier Ruiz-del-Solar, Rodrigo Palma Amestoy, Paul A. Vallejos, Román Marchant, P. Zegers	Designing Fall Sequences That Minimize Robot Damage in Robot Soccer.	RoboCup	2008	DBLP DOI BibTeX RDF
15	Xianpeng Wang 0002, Lixin Tang	A Hybrid VNS with TS for the Single Machine Scheduling Problem to Minimize the Sum of Weighted Tardiness of Jobs.	ICIC (2)	2008	DBLP DOI BibTeX RDF
15	Li Li 0008, Fei Qiao, Qidi Wu	ACO-Based Scheduling of Parallel Batch Processing Machines with Incompatible Job Families to Minimize Total Weighted Tardiness.	ANTS Conference	2008	DBLP DOI BibTeX RDF
15	Matt Gibson 0001, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan	On Metric Clustering to Minimize the Sum of Radii.	SWAT	2008	DBLP DOI BibTeX RDF	k-clustering, k-cover, metric clustering, planar metric, clustering, doubling metric
15	Ingo Scholtes, Jean Botev, Markus Esch, Hermann Schloss, Peter Sturm 0001	Using Epidemic Hoarding to Minimize Load Delays in P2P Distributed Virtual Environments.	CollaborateCom	2008	DBLP DOI BibTeX RDF	Epidemic Aggregation, P2P, Gossiping, DVE, Hoarding
15	Matthew W. Jacobson, Jeffrey A. Fessler	An Expanded Theoretical Treatment of Iteration-Dependent Majorize-Minimize Algorithms.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
15	Yongduek Seo, Richard I. Hartley	A Fast Method to Minimize L Error Norm for Geometric Vision Problems.	ICCV	2007	DBLP DOI BibTeX RDF
15	Thanyapat Sakunkonchak, Satoshi Komatsu, Masahiro Fujita	Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction.	ATVA	2007	DBLP DOI BibTeX RDF
15	Shuyan Bai, Fuzeng Zhang, Shuguang Li, Qiming Liu	Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness.	FAW	2007	DBLP DOI BibTeX RDF
15	Bin Bin Chen 0001, Pascale Vicat-Blanc Primet	Scheduling deadline-constrained bulk data transfers to minimize network congestion.	CCGRID	2007	DBLP DOI BibTeX RDF
15	Naohiko Sugita, Yoshikazu Nakajima, Mamoru Mitsuishi, Shosaku Kawata, Kazuo Fujiwara, Nobuhiro Abe, Toshifumi Ozaki, Masahiko Suzuki	Cutting Tool System to Minimize Soft Tissue Damage for Robot-Assisted Minimally Invasive Orthopedic Surgery.	MICCAI (1)	2007	DBLP DOI BibTeX RDF
15	Yuzhong Zhang, Zhigang Cao	An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan.	COCOA	2007	DBLP DOI BibTeX RDF
15	Elhadi M. Shakshuki, Haroon Malik	Agent Based Approach to Minimize Energy Consumption for Border Nodes in Wireless Sensor Network.	AINA	2007	DBLP DOI BibTeX RDF
15	Sharath Jayaprakash, Nihar R. Mahapatra	Partitioned Hybrid Encoding to Minimize On-Chip Energy Dissipation ofWide Microprocessor Buses.	VLSI Design	2007	DBLP DOI BibTeX RDF
15	Khoi Anh Phan, Zahir Tari, Peter Bertók	eSMP: A Multicast Protocol to Minimize SOAP Network Traffic in Low Bandwidth Environments.	LCN	2007	DBLP DOI BibTeX RDF
15	Hing Kai Chan, Felix T. S. Chan	Early order completion contract approach to minimize the impact of demand uncertainty on supply chains.	IEEE Trans. Ind. Informatics	2006	DBLP DOI BibTeX RDF
15	John N. Hooker	An Integrated Method for Planning and Scheduling to Minimize Tardiness.	Constraints An Int. J.	2006	DBLP DOI BibTeX RDF	Cumulative scheduling, Hybrid methods, Planning and scheduling, Benders decomposition
15	Berit Johannes	Scheduling parallel jobs to minimize the makespan.	J. Sched.	2006	DBLP DOI BibTeX RDF	parallel jobs, approximation algorithms, online algorithms, multiprocessor scheduling, list scheduling, release dates
15	Jinjiang Yuan, Zhaohui Liu 0001, C. T. Ng 0001, T. C. Edwin Cheng	Single machine batch scheduling problem with family setup times and release dates to minimize makespan.	J. Sched.	2006	DBLP DOI BibTeX RDF	Scheduling, Makespan, Family, Batching, Release dates
15	Zhongjun Tian, C. T. Ng 0001, T. C. Edwin Cheng	An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness.	J. Sched.	2006	DBLP DOI BibTeX RDF	Equal-length jobs, Total tardiness, Preemptive scheduling, Single machine, Release date
15	Guido Proietti, Peter Widmayer	Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii.	ISAAC	2006	DBLP DOI BibTeX RDF	Clustering problems, Graph radius, NP-hardness, Graph partition, Facility location problems
15	Philippe Baptiste	Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management.	SODA	2006	DBLP DOI BibTeX RDF
15	Sanjeev Baskiyar, Kiran Kumar Palli	Low Power Scheduling of DAGs to Minimize Finish Times.	HiPC	2006	DBLP DOI BibTeX RDF	Scheduling, Power, Heterogeneous, DAG, Makespan, Voltage Scaling
15	Hadeel D. Idrees, Mahdy O. Sinnokrot, Sameh Al-Shihabi	A reinforcement learning algorithm to minimize the mean tardiness of a single machine with controlled capacity.	WSC	2006	DBLP DOI BibTeX RDF
15	Mohamed Maiza, Hamid Hentous, Abdenour Labed	An Efficient Heuristic for Scheduling a Flowshop to Minimize the Makespan Criterion.	ISCC	2006	DBLP DOI BibTeX RDF	extended flow, Scheduling, Branch and bound, marking, flow-shop
15	Krishnamoorthy Natarajan, S. J. Nagalakshmi	Repeater Sizing and Insertion Length of Interconnect to Minimize the Overall Time Delay using a Truncated Fourier Series Approach.	CCECE	2006	DBLP DOI BibTeX RDF
15	Qinghui Tang, Sandeep K. S. Gupta, Daniel Stanzione, Phil Cayton	Thermal-Aware Task Scheduling to Minimize Energy Usage of Blade Server Based Datacenters.	DASC	2006	DBLP DOI BibTeX RDF
15	Gruia Calinescu, Michael J. Pelsmajer	Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance.	FSTTCS	2006	DBLP DOI BibTeX RDF
15	Guoqing Wang, Hongyi Sun, Chengbin Chu	Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF
15	H. A. J. Crauwels, Chris N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove	Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs.	J. Sched.	2005	DBLP DOI BibTeX RDF	set-up time, scheduling, branch and bound, families, batches, single machine
15	Liying Kang, T. C. Edwin Cheng, C. T. Ng 0001, Min Zhao	Scheduling to Minimize Makespan with Time-Dependent Processing Times.	ISAAC	2005	DBLP DOI BibTeX RDF	fully polynomial approximation scheme, makespan, parallel machines scheduling
15	Tao Wang, Daxin Liu 0001	Scheduling AND/OR Precedence Constraints Jobs to Minimize the Makespan by Mapping from CPM to AND/OR Network.	RTCSA	2005	DBLP DOI BibTeX RDF
15	John N. Hooker	Planning and Scheduling to Minimize Tardiness.	CP	2005	DBLP DOI BibTeX RDF
15	Noga Alon, Yossi Azar, Shai Gutner	Admission control to minimize rejections and online set cover with repetitions.	SPAA	2005	DBLP DOI BibTeX RDF	admission control, competitive, set cover, on-line
15	Jaudelice Cavalcante de Oliveira, Caterina M. Scoglio, Ian F. Akyildiz, George Uhl	New preemption policies for DiffServ-aware traffic engineering to minimize rerouting in MPLS networks.	IEEE/ACM Trans. Netw.	2004	DBLP DOI BibTeX RDF	traffic engineering (TE), diffserv, preemption, MPLS networks
15	Luca Becchetti, Stefano Leonardi 0001	Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.	J. ACM	2004	DBLP DOI BibTeX RDF	multilevel feedback, randomized algorithms, Probabilistic analysis, flow time
15	Stéphane Dauzère-Pérès, Marc Sevaux	An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling.	J. Sched.	2004	DBLP DOI BibTeX RDF	one-machine scheduling, late jobs, branch and bound
15	Bo Chen 0002, Xiaotie Deng, Wenan Zang	On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	scheduling, on-line, performance guarantee, batch processing
15	Jason McCullough, Eric Torng	SRPT optimally utilizes faster machines to minimize flow time.	SODA	2004	DBLP BibTeX RDF
15	Jingyuan Zhang, Guangbin Fan	A Cellular Network Planning Technique to Minimize Exposure to RF Radiation.	ICPP Workshops	2004	DBLP DOI BibTeX RDF
15	Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar 0001	Multi-processor scheduling to minimize flow time with epsilon resource augmentation.	STOC	2004	DBLP DOI BibTeX RDF	multi-processor scheduling, load balancing, online algorithms, stretch, resource augmentation, flow time
15	María C. Molina, José M. Mendías, Román Hermida	High-Level Allocation to Minimize Internal Hardware Wastage.	DATE	2003	DBLP DOI BibTeX RDF
15	Luca Becchetti, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Guido Schäfer	Scheduling to Minimize Flow Time Metrics.	IPDPS	2003	DBLP DOI BibTeX RDF	scheduling on multiple machines, competitive analysis, On-line algorithms
15	Sanjeev Baskiyar, Prashanth C. SaiRanga	Scheduling Directed A-cyclic Task Graphs on Heterogeneous Network of Workstations to Minimize Schedule Length.	ICPP Workshops	2003	DBLP DOI BibTeX RDF	scheduling, DAG, heterogeneous computing, makespan, task graph
15	Noureddine Chabini, Ismaïl Chabini, El Mostapha Aboulhamid, Yvon Savaria	Unification of basic retiming and supply voltage scaling to minimize dynamic power consumption for synchronous digital designs.	ACM Great Lakes Symposium on VLSI	2003	DBLP DOI BibTeX RDF	supply voltage scaling, performance, power consumption, CMOS, retiming, digital design
15	Edward J. Anderson, Chris N. Potts	On-line scheduling of a single machine to minimize total weighted completion time.	SODA	2002	DBLP BibTeX RDF
15	Bo Chen 0002, Xiaotie Deng, Wenan Zang	On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time.	ISAAC	2001	DBLP DOI BibTeX RDF
15	Frank Padberg	Scheduling Software Projects to Minimize the Development Time and Cost with a Given Staff.	APSEC	2001	DBLP DOI BibTeX RDF
15	Krzysztof Giaro, Marek Kubale, Michal Malafiejski, Konrad Piwakowski	Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.	PPAM	2001	DBLP DOI BibTeX RDF
15	Christoph Scholl 0001, Marc Herbstritt, Bernd Becker 0001	Exploiting don't cares to minimize *BMDs.	ISCAS (5)	2001	DBLP DOI BibTeX RDF
15	Juan A. Montiel-Nelson, De de Armas, Roberto Sarmiento, Antonio Núñez, Saeid Nooshabadi	A compact layout technique to minimize high frequency switching effects in high speed circuits.	ISCAS (4)	2001	DBLP DOI BibTeX RDF
15	Luca Becchetti, Stefano Leonardi 0001	Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines.	STOC	2001	DBLP DOI BibTeX RDF
15	Moses Charikar, Rina Panigrahy	Clustering to minimize the sum of cluster diameters.	STOC	2001	DBLP DOI BibTeX RDF
15	Michel Renovell, Jean-Michel Portal, Joan Figueras, Yervant Zorian	An Approach to Minimize the Test Configuration for the Logic Cells of the Xilinx XC4000 FPGAs Family.	J. Electron. Test.	2000	DBLP DOI BibTeX RDF	FPGA, test, ATPG, iterative testing
15	Michael Münch, Norbert Wehn, Bernd Wurth, Renu Mehra, Jim Sproch	Automating RT-Level Operand Isolation to Minimize Power Consumption in Datapaths.	DATE	2000	DBLP DOI BibTeX RDF
15	Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer	Approximation Algorithms for Clustering to Minimize the Sum of Diameters.	SWAT	2000	DBLP DOI BibTeX RDF
15	Hugo Cheung, Sandeep K. Gupta 0001	A Framework to Minimize Test Escape and Yield Loss during IDDQ Testing: A Case Study.	VTS	2000	DBLP DOI BibTeX RDF	critical severity, test escape, fault modeling, IDDQ, yield loss
15	Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon	Scheduling to Minimize the Average Completion Time of Dedicated Tasks.	FSTTCS	2000	DBLP DOI BibTeX RDF
15	John Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu	Scheduling Parallelizable Tasks to Minimize Average Response Time.	SPAA	1994	DBLP DOI BibTeX RDF
15	David D. Grossman, Harvey F. Silverman	Placement of Records on a Secondary Storage Device to Minimize Access Time.	J. ACM	1973	DBLP DOI BibTeX RDF
13	Kenji Shoji, Kazunori Kato, Fubito Toyama	3-D Interpretation of Single Line Drawings Based on Entropy Minimization Principle.	CVPR (2)	2001	DBLP DOI BibTeX RDF
12	Jixuan Wang, Deli Qiao	How to Minimize the Weighted Sum AoI in Multi-Source Status Update Systems: TDMA or NOMA?	IEEE Trans. Veh. Technol.	2024	DBLP DOI BibTeX RDF
12	Pranay Agarwal, Sharayu Moharir	NOMA Versus OMA: Scheduling to Minimize the Age of Information.	IEEE Trans. Veh. Technol.	2024	DBLP DOI BibTeX RDF