Sciweavers

14386 search results - page 389 / 2878
» The Chinese Generals Problem
Sort
View
ECAI
1998
Springer
15 years 11 months ago
On Non-Conservative Plan Modification
The problem of minimally modifying a plan in response to changes in the specification of the planning problem has already been investigated in the literature. In this paper we cons...
Paolo Liberatore
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
15 years 8 months ago
The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....
JGO
2008
98views more  JGO 2008»
15 years 6 months ago
Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
We consider nonsmooth multiobjective fractional programming problems with inequality and equality constraints. We establish the necessary and sufficient optimality conditions under...
S. Nobakhtian
TCS
2008
15 years 6 months ago
Online unit clustering: Variations on a theme
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We stud...
Leah Epstein, Asaf Levin, Rob van Stee
AAAI
2012
13 years 9 months ago
Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
Akshat Kumar, XiaoJian Wu, Shlomo Zilberstein