1480 search results - page 163 / 296 » Ants can solve constraint satisfaction problems |
190
click to vote
CSCLP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
153
Voted
INFORMS
2010
15 years 4 months ago
2010
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
177
click to vote
ISCAS
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
195
Voted
CP
2007
Springer
16 years 1 months ago
2007
Springer
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
177
Voted
AAAI
2004
15 years 8 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...