720 search results - page 124 / 144 » Nonrepetitive colorings of graphs |
AAAI
1998
15 years 1 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
JCP
2008
14 years 11 months ago
2008
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
118
click to vote
INTEGRATION
2006
14 years 11 months ago
2006
Improving testability during the early stages of high-level synthesis has several benefits including reduced test hardware overheads, reduced test costs, reduced design iterations...
JETAI
2008
14 years 11 months ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...