3367 search results - page 109 / 674 » Incremental assignment problem |
123
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Achieving design closure is one of the biggest headaches for modern VLSI designers. This problem is exacerbated by high-level design automation tools that ignore increasingly impo...
146
click to vote
JMLR
2010
14 years 9 months ago
2010
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
144
click to vote
JCSS
2002
15 years 2 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
125
click to vote
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
113
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...