Sciweavers

2100 search results - page 118 / 420
» Observation Can Be as Effective as Action in Problem Solving
Sort
View
JGO
2008
83views more  JGO 2008»
13 years 9 months ago
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
Lewis Ntaimo, Matthew W. Tanner
AIPS
2006
13 years 10 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
EUSAI
2007
Springer
14 years 3 months ago
Situated Public News and Reminder Displays
In this paper we present concepts for and experiences with a Situated Public Display system deployed in a university setting. We identify the rate with which information is updated...
Jörg Müller, Oliver Paczkowski, Antonio ...
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
14 years 18 days ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
ECCV
2008
Springer
13 years 10 months ago
Scene Segmentation Using the Wisdom of Crowds
Given a collection of images of a static scene taken by many different people, we identify and segment interesting objects. To solve this problem, we use the distribution of images...
Ian Simon, Steven M. Seitz