Sciweavers

1102 search results - page 106 / 221
» Dynamic Constraint Models for Planning and Scheduling Proble...
Sort
View
ECAI
2010
Springer
13 years 10 months ago
Learning action effects in partially observable domains
We investigate the problem of learning action effects in partially observable STRIPS planning domains. Our approach is based on a voted kernel perceptron learning model, where act...
Kira Mourão, Ronald P. A. Petrick, Mark Ste...
ATMOS
2007
177views Optimization» more  ATMOS 2007»
13 years 10 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
JEC
2006
107views more  JEC 2006»
13 years 9 months ago
A dynamically reconfigurable cache for multithreaded processors
Chip multi-processors (CMP) are rapidly emerging as an important design paradigm for both high performance and embedded processors. These machines provide an important performance...
Alex Settle, Dan Connors, Enric Gibert, Antonio Go...
FLAIRS
2008
13 years 11 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
TAP
2009
Springer
178views Hardware» more  TAP 2009»
14 years 3 months ago
Dynamic Symbolic Execution for Testing Distributed Objects
Abstract. This paper extends dynamic symbolic execution to distributed and concurrent systems. Dynamic symbolic execution can be used in software testing to systematically identify...
Andreas Griesmayer, Bernhard K. Aichernig, Einar B...