Sciweavers

7978 search results - page 444 / 1596
» Combining shared-coin algorithms
Sort
View
DAC
2004
ACM
16 years 7 months ago
Abstraction refinement by controllability and cooperativeness analysis
ion Refinement by Controllability and Cooperativeness Analysis Freddy Y.C. Mang and Pei-Hsin Ho Advanced Technology Group, Synopsys, Inc. {fmang, pho}@synopsys.com nt a new abstrac...
Freddy Y. C. Mang, Pei-Hsin Ho
ICML
2006
IEEE
16 years 7 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
ICML
2002
IEEE
16 years 7 months ago
Active + Semi-supervised Learning = Robust Multi-View Learning
In a multi-view problem, the features of the domain can be partitioned into disjoint subsets (views) that are sufficient to learn the target concept. Semi-supervised, multi-view a...
Ion Muslea, Steven Minton, Craig A. Knoblock
RTSS
2007
IEEE
16 years 1 months ago
Real-Time Query Scheduling for Wireless Sensor Networks
Recent years have seen the emergence of wireless sensor network systems that must support high data rate and realtime queries of physical environments. This paper proposes Real-Ti...
Octav Chipara, Chenyang Lu, Gruia-Catalin Roman
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 29 days ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li