Sciweavers

2434 search results - page 450 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ATAL
2006
Springer
15 years 4 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
CP
2006
Springer
15 years 4 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann
AIPS
2009
15 years 1 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
BMCBI
2006
114views more  BMCBI 2006»
15 years 14 days ago
Evaluation and comparison of mammalian subcellular localization prediction methods
Background: Determination of the subcellular location of a protein is essential to understanding its biochemical function. This information can provide insight into the function o...
Josefine Sprenger, J. Lynn Fink, Rohan D. Teasdale
BMCBI
2006
116views more  BMCBI 2006»
15 years 14 days 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...