Sciweavers

2244 search results - page 83 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
AI
2012
Springer
14 years 1 months ago
Plan recognition in exploratory domains
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
Ya'akov Gal, Swapna Reddy, Stuart M. Shieber, Ande...
CPAIOR
2007
Springer
16 years 11 days ago
Solving a Stochastic Queueing Control Problem with Constraint Programming
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custome...
Daria Terekhov, J. Christopher Beck
ICCAD
1997
IEEE
53views Hardware» more  ICCAD 1997»
15 years 10 months ago
A quantitative approach to functional debugging
We introduce a novel cut-based debugging paradigm. It coordinates design emulation and simulation and enables fast transition from one to another. Emulation or functional implemen...
Darko Kirovski, Miodrag Potkonjak
PRICAI
2010
Springer
15 years 4 months ago
Partial Weighted MaxSAT for Optimal Planning
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
15 years 11 months ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya