Sciweavers

512 search results - page 19 / 103
» Reducibility among equilibrium problems
Sort
View
IJCAI
2007
13 years 11 months ago
Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
Chih-Wei Hsu, Benjamin W. Wah, Ruoyun Huang, Yixin...
IJCAI
1989
13 years 10 months ago
A Planning/Scheduling Methodology for the Constrained Resource Problem
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
Naiping Keng, David Y. Y. Yun
EOR
2006
73views more  EOR 2006»
13 years 9 months ago
Enforcing minimum run length in the cutting stock problem
Deckling, cutting stock or trim loss problems arise when small units are to be fitted into large ones. One aims to reduce stock usage and setups, then favors long runs, surplus ov...
Adolf Diegel, Garth Miller, Edouard Montocchio, Si...
KI
1999
Springer
14 years 1 months ago
On the Translation of Qualitative Spatial Reasoning Problems into Modal Logics
Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A...
Werner Nutt
AMEC
2004
Springer
14 years 3 months ago
Designing Auctions for Deliberative Agents
Abstract. In many settings, bidding agents for auctions do not know their preferences a priori. Instead, they must actively determine them through deliberation (e.g., information p...
Kate Larson, Tuomas Sandholm