Sciweavers

184 search results - page 22 / 37
» Superposition for Fixed Domains
Sort
View
AIPS
2006
15 years 1 months ago
Optimal Rectangle Packing: A Meta-CSP Approach
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
Michael D. Moffitt, Martha E. Pollack
76
Voted
AAAI
1994
15 years 1 months ago
Knowledge Refinement in a Reflective Architecture
A knowledge acquisition tool should provide a user with maximum guidance in extending and debugging a knowledge base, by preventing inconsistencies and knowledge gaps that may ari...
Yolanda Gil
97
Voted
4OR
2008
79views more  4OR 2008»
15 years 17 days ago
MIP-based heuristic for non-standard 3D-packing problems
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
Giorgio Fasano
105
Voted
AIPS
2010
15 years 2 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
107
Voted
FASE
2008
Springer
15 years 2 months ago
Consistent Integration of Models Based on Views of Visual Languages
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
Hartmut Ehrig, Karsten Ehrig, Claudia Ermel, Ulrik...