1197 search results - page 20 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
IEEEVAST
2010
13 years 2 months ago
2010
Interaction and manual manipulation have been shown in the cognitive science literature to play a critical role in problem solving. Given different types of interactions or constr...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
AI
2003
Springer
14 years 1 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...