Sciweavers

469 search results - page 21 / 94
» A Branch-and-Prune Algorithm for Solving Systems of Distance...
Sort
View
AUSAI
2003
Springer
14 years 1 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar
RECOMB
2005
Springer
14 years 8 months ago
Predicting Protein-Peptide Binding Affinity by Learning Peptide-Peptide Distance Functions
Many important cellular response mechanisms are activated when a peptide binds to an appropriate receptor. In the immune system, the recognition of pathogen peptides begins when th...
Chen Yanover, Tomer Hertz
BMCBI
2006
111views more  BMCBI 2006»
13 years 8 months ago
PepDist: A New Framework for Protein-Peptide Binding Prediction based on Learning Peptide Distance Functions
Background: Many different aspects of cellular signalling, trafficking and targeting mechanisms are mediated by interactions between proteins and peptides. Representative examples...
Tomer Hertz, Chen Yanover
ICRA
2009
IEEE
152views Robotics» more  ICRA 2009»
14 years 2 months ago
Reachability-guided sampling for planning under differential constraints
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...
AICCSA
2006
IEEE
95views Hardware» more  AICCSA 2006»
14 years 2 months ago
DEPICT: A High-Level Formal Language For Modeling Constraint Satisfaction Problems
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
Abdulwahed M. Abbas, Edward P. K. Tsang, Ahmad H. ...