1480 search results - page 76 / 296 » Ants can solve constraint satisfaction problems |
RC
2002
14 years 9 months ago
2002
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
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...
103
click to vote
SIAMSC
2010
14 years 8 months ago
2010
In this paper, we study alternating direction methods for solving constrained total-variation image restoration and reconstruction problems. Alternating direction methods can be im...
140
click to vote
ICAL
2011
13 years 9 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
100
click to vote
AGENTS
2001
Springer
15 years 2 months ago
2001
Springer
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...