2109 search results - page 12 / 422 » Solving Necklace Constraint Problems |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
HEURISTICS
2000
14 years 11 months ago
2000
IDEAL
2003
Springer
15 years 5 months ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
117
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
101
click to vote
QSHINE
2005
IEEE
15 years 5 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...