Sciweavers

578 search results - page 89 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
14 years 21 days ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 6 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
14 years 3 months ago
Techniques for highly multiobjective optimisation: some nondominated points are better than others
The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much e...
David W. Corne, Joshua D. Knowles
VLSID
2005
IEEE
120views VLSI» more  VLSID 2005»
14 years 2 months ago
On Finding Consecutive Test Vectors in a Random Sequence for Energy-Aware BIST Design
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattachar...
EKAW
2008
Springer
13 years 10 months ago
An Ontology-Centric Approach to Sensor-Mission Assignment
Sensor-mission assignment involves the allocation of sensor and other information-providing resources to missions in order to cover the information needs of the individual tasks in...
Mario Gomez, Alun D. Preece, Matthew P. Johnson, G...