Sciweavers

1529 search results - page 174 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
AAAI
2010
15 years 5 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
BMCBI
2010
117views more  BMCBI 2010»
15 years 4 months ago
Beyond rotamers: a generative, probabilistic model of side chains in proteins
Background: Accurately covering the conformational space of amino acid side chains is essential for important applications such as protein design, docking and high resolution stru...
Tim Harder, Wouter Boomsma, Martin Paluszewski, Je...
DAC
2004
ACM
16 years 5 months ago
Exploiting structure in symmetry detection for CNF
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah...
ENTCS
2006
136views more  ENTCS 2006»
15 years 4 months ago
Adaptive Application of SAT Solving Techniques
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Ohad Shacham, Karen Yorav
JCB
2006
115views more  JCB 2006»
15 years 4 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger