1197 search results - page 7 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
PRICAI
1998
Springer
14 years 5 days ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
QSHINE
2005
IEEE
14 years 1 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
IAT
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. A team of mobile sensors can be used for coverage of targets in different environments. The dynamic nature of such an application requires the team of agents to adjust th...