810 search results - page 138 / 162 » Solving Time-Dependent Planning Problems |
EVOW
2001
Springer
14 years 12 days ago
2001
Springer
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
IUI
1998
ACM
14 years 4 days ago
1998
ACM
Life-likeanimatedinterfaceagentsforknowledge-basedlearning environments can provide timely, customized advice to support students’ problem solving. Because of their strong visua...
AAAI
2007
13 years 10 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
AIPS
2007
13 years 10 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
AAAI
2010
13 years 9 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...