Sciweavers

617 search results - page 67 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
BMCBI
2006
116views more  BMCBI 2006»
13 years 8 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
AI
2006
Springer
13 years 8 months ago
Is real-valued minimax pathological?
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...
Mitja Lustrek, Matjaz Gams, Ivan Bratko
SIGSOFT
2004
ACM
14 years 8 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...
INFOCOM
2003
IEEE
14 years 1 months ago
Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations
— Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all...
Arindam Kumar Das
ICDM
2002
IEEE
91views Data Mining» more  ICDM 2002»
14 years 1 months ago
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
Christian Borgelt, Michael R. Berthold