Sciweavers

170 search results - page 17 / 34
» Solving Simple Planning Problems with More Inference and No ...
Sort
View
ISDA
2008
IEEE
14 years 2 months ago
Combining Clustering and Bayesian Network for Gene Network Inference
Gene network reconstruction is a multidisciplinary research area involving data mining, machine learning, statistics, ontologies and others. Reconstructed gene network allows us t...
Suhaila Zainudin, Safaai Deris
FLAIRS
2004
13 years 9 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 7 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
ICML
1998
IEEE
14 years 8 months ago
RL-TOPS: An Architecture for Modularity and Re-Use in Reinforcement Learning
This paper introduces the RL-TOPs architecture for robot learning, a hybrid system combining teleo-reactive planning and reinforcement learning techniques. The aim of this system ...
Malcolm R. K. Ryan, Mark D. Pendrith
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson