Sciweavers

944 search results - page 104 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
SIROCCO
2004
14 years 11 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
CIBCB
2007
IEEE
15 years 4 months ago
Overestimation for Multiple Sequence Alignment
Abstract— Multiple sequence alignment is an important problem in computational biology. A-star is an algorithm that can be used to find exact alignments. We present a simple mod...
Tristan Cazenave
SIGSOFT
2004
ACM
15 years 10 months ago
Heuristic-guided counterexample search in FLAVERS
One of the benefits of finite-state verification (FSV) tools, such as model checkers, is that a counterexample is provided when the property cannot be verified. Not all counterexa...
Jianbin Tan, George S. Avrunin, Lori A. Clarke, Sh...
TKDE
2008
134views more  TKDE 2008»
14 years 10 months ago
Contraflow Transportation Network Reconfiguration for Evacuation Route Planning
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
Sangho Kim, Shashi Shekhar, Manki Min
AAAI
2000
14 years 11 months ago
Exploiting a Thesaurus-Based Semantic Net for Knowledge-Based Search
With the growth of on-line information, the need for better resource location services is growing rapidly. A popular goal is to conduct search in terms of concepts, rather than wo...
Peter Clark, John Thompson, Heather Holmback, Lisb...