Sciweavers

405 search results - page 27 / 81
» AI planning: solutions for real world problems
Sort
View
CEC
2009
IEEE
13 years 5 months ago
Multi-objective Combinatorial Optimisation with Coincidence algorithm
-- Most optimization algorithms that use probabilistic models focus on extracting the information from good solutions found in the population. A selection method discards the below...
Warin Wattanapornprom, Panuwat Olanviwitchai, Para...
SAINT
2008
IEEE
14 years 2 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
JAIR
2006
157views more  JAIR 2006»
13 years 7 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
AI
2003
Springer
14 years 25 days ago
Case Authoring from Text and Historical Experiences
The problem of repair and maintenance of complex systems, such as aircraft, cars and trucks is certainly a nontrivial task. Maintenance technicians must use a great amount of knowl...
Marvin Zaluski, Nathalie Japkowicz, Stan Matwin
AAMAS
1998
Springer
13 years 7 months ago
Real-Time Search for Autonomous Agents and Multiagent Systems
Since real-time search provides an attractive framework for resource-bounded problem solving, this paper extends the framework for autonomous agents and for a multiagent world. To ...
Toru Ishida