808 search results - page 104 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
TSP
2010
14 years 4 months ago
2010
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
AAAI
2004
14 years 11 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
192
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...