1480 search results - page 186 / 296 » Ants can solve constraint satisfaction problems |
153
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
209
click to vote
JAIR
2011
15 years 1 months ago
2011
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
161
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we consider sparse decomposition (SD) of twodimensional (2D) signals on overcomplete dictionaries with separable atoms. Although, this problem can be solved by conv...
197
click to vote
MMM
2006
Springer
16 years 17 days ago
2006
Springer
MPEG-7 is an excellent choice for the description of audiovisual content due to its flexibility and comprehensiveness. The drawback is that these properties also increase the comp...
172
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...