Sciweavers

2715 search results - page 38 / 543
» An Implementation of Narrowing Strategies
Sort
View
CG
2006
Springer
13 years 8 months ago
Automatic Strategy Verification for Hex
We present a concise and/or-tree notation for describing Hex strategies together with an easily implemented algorithm for verifying strategy correctness. To illustrate our algorith...
Ryan B. Hayward, Broderick Arneson, Philip Henders...
ACSD
2006
IEEE
118views Hardware» more  ACSD 2006»
14 years 2 months ago
Strategies for Optimised STG Decomposition
— When synthesising an asynchronous circuit from an STG, one often encounters the state explosion problem. In order to alleviate this problem one can decompose the STG into small...
Mark Schäfer, Walter Vogler, Ralf Wollowski, ...
GECCO
2009
Springer
153views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed
In this paper, we benchmark the (1+1) Evolution Strategy (ES) with one-fifth success rule which is one of the first and simplest adaptive search algorithms proposed for optimiza...
Anne Auger
LCTRTS
2001
Springer
14 years 1 months ago
Evaluating and Optimizing Thread Pool Strategies for Real-Time CORBA
Strict control over the scheduling and execution of processor resources is essential for many fixed-priority real-time applications. To facilitate this common requirement, the Re...
Irfan Pyarali, Marina Spivak, Ron Cytron, Douglas ...
ECAI
2004
Springer
14 years 2 months ago
Assessing the Bias of Classical Planning Strategies on Makespan-Optimizing Scheduling
This paper investigates a loosely coupled approach to planning and scheduling integration, which consists of cascading a planner and a scheduler. While other implementations of thi...
Federico Pecora, Riccardo Rasconi, Amedeo Cesta