Sciweavers

633 search results - page 75 / 127
» Locality and Hard SAT-Instances
Sort
View
CC
2001
Springer
121views System Software» more  CC 2001»
14 years 2 months ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert
DATE
1999
IEEE
162views Hardware» more  DATE 1999»
14 years 2 months ago
MOCSYN: Multiobjective Core-Based Single-Chip System Synthesis
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...
Robert P. Dick, Niraj K. Jha
ICS
1999
Tsinghua U.
14 years 2 months ago
Mechanisms and policies for supporting fine-grained cycle stealing
This paper presents an investigation into local mechanisms and scheduling policies that allow guest processes to efficiently exploit otherwise-idle workstation resources. Unlike t...
Kyung Dong Ryu, Jeffrey K. Hollingsworth, Peter J....
CEC
2007
IEEE
14 years 1 months ago
A hybrid evolutionary approach to the university course timetabling problem
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
Salwani Abdullah, Edmund K. Burke, Barry McCollum
CEC
2009
IEEE
14 years 1 months ago
Automatic system identification based on coevolution of models and tests
In evolutionary robotics, controllers are often designed in simulation, then transferred onto the real system. Nevertheless, when no accurate model is available, controller transfe...
Sylvain Koos, Jean-Baptiste Mouret, Stéphan...