1197 search results - page 17 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
175
Voted
ECAI
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Learning in the context of constraint solving is a technique by which previously unknown constraints are uncovered during search and used to speed up subsequent search. R...
162
click to vote
GECCO
2009
Springer
16 years 5 days ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
185
click to vote
AGENTS
2001
Springer
15 years 10 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...
151
click to vote
DATE
2007
IEEE
15 years 12 months ago
2007
IEEE
This paper introduces a method and tool-support for the automatic analysis and verification of hybrid and embedded control systems, whose continuous dynamics are often modelled u...
141
Voted
FLAIRS
2003
15 years 7 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...