Sciweavers

612 search results - page 105 / 123
» An Empirical Study of Agent Programs
Sort
View
BMCBI
2011
13 years 3 months ago
SAQC: SNP array quality control
Background: Genome-wide single-nucleotide polymorphism (SNP) arrays containing hundreds of thousands of SNPs from the human genome have proven useful for studying important human ...
Hsin-Chou Yang, Hsin-Chi Lin, Meijyh Kang, Chun-Ho...
CP
2007
Springer
14 years 3 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
ILP
2007
Springer
14 years 3 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche
COMPULOG
1999
Springer
14 years 1 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
AAAI
2006
13 years 10 months ago
Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
Yaxin Liu, Sven Koenig