693 search results - page 51 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
159
click to vote
IPM
2006
15 years 3 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
151
Voted
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
122
Voted
ESTIMEDIA
2009
Springer
15 years 10 months ago
2009
Springer
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...
149
click to vote
QSHINE
2005
IEEE
15 years 9 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...
115
click to vote
AAAI
2006
15 years 5 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...