2657 search results - page 77 / 532 » On the complexity of hierarchical problem solving |
CP
2005
Springer
15 years 7 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
135
click to vote
ARCS
2004
Springer
15 years 6 months ago
2004
Springer
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
122
click to vote
JALC
2002
15 years 1 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
91
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
118
click to vote
JVA
2006
IEEE
15 years 7 months ago
2006
IEEE
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...