1614 search results - page 118 / 323 » Breadth-First Heuristic Search |
158
click to vote
ML
2008
ACM
15 years 4 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
123
click to vote
IWANN
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...
118
click to vote
ASPDAC
2005
ACM
15 years 10 months ago
2005
ACM
- This paper extends the depth first search (DFS) used in the previously proposed witness string method for generating efficient test vectors. A state pruning method is added that ...
112
click to vote
AUSAI
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper presents a new solution for combining technology mapping with placement, coupling the two into one phase. The original aspects of our work are the use of libraryless ma...