Sciweavers

1983 search results - page 266 / 397
» Competitive graph searches
Sort
View
IJCAI
2003
13 years 9 months ago
In Defense of PDDL Axioms
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...
Sylvie Thiébaux, Jörg Hoffmann, Bernha...
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
13 years 9 months ago
Combatting financial fraud: a coevolutionary anomaly detection approach
A major difficulty for anomaly detection lies in discovering boundaries between normal and anomalous behavior, due to the deficiency of abnormal samples in the training phase. In...
Shelly Xiaonan Wu, Wolfgang Banzhaf
AIPS
2010
13 years 8 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger
IJRR
2010
135views more  IJRR 2010»
13 years 5 months ago
On the Design and Use of a Micro Air Vehicle to Track and Avoid Adversaries
The MAV '08 competition focused on the problem of using air and ground vehicles to locate and rescue hostages being held in a remote building. To execute this mission, a numbe...
Ruijie He, Abraham Bachrach, Michael Achtelik, Alb...
LOGCOM
2011
12 years 11 months ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea