Sciweavers

4081 search results - page 781 / 817
» Scheduling in polling systems
Sort
View
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
MI
1993
13 years 9 months ago
Putting knowledge rich plan representations to use
AI planning research is now maturing and nding practical application in the commercial, industrial, engineering and defence sectors. This has led to a rapid expansion in the last ...
Austin Tate
AIPS
2009
13 years 8 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
2008
169views more  BMCBI 2008»
13 years 7 months ago
MausDB: An open source application for phenotype data and mouse colony management in large-scale mouse phenotyping projects
Background: Large-scale, comprehensive and standardized high-throughput mouse phenotyping has been established as a tool of functional genome research by the German Mouse Clinic a...
Holger Maier, Christoph Lengger, Bruno Simic, Helm...
CORR
2008
Springer
185views Education» more  CORR 2008»
13 years 7 months ago
Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
Yong Zhao, Ioan Raicu, Ian T. Foster, Mihael Hateg...