1263 search results - page 64 / 253 » A* with Bounded Costs |
165
click to vote
RTAS
2010
IEEE
15 years 4 months ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
151
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
144
click to vote
CPAIOR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
297
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
147
click to vote
ALT
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...