Sciweavers

641 search results - page 47 / 129
» On robust online scheduling algorithms
Sort
View
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
13 years 12 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
IROS
2006
IEEE
145views Robotics» more  IROS 2006»
14 years 2 months ago
An Automatic Approach to Online Color Training in RoboCup Environments
— Many approaches for extracting landmarks and objects from a camera image based on their color coding were published in the RoboCup domain. They are quite sophisticated and tune...
Patrick Heinemann, Frank Sehnke, Felix Streichert,...
DAC
2005
ACM
14 years 9 months ago
Optimal procrastinating voltage scheduling for hard real-time systems
This paper presents an optimal procrastinating voltage scheduling (OP-DVS) for hard real-time systems using stochastic workload information. Algorithms are presented for both sing...
Yan Zhang, Zhijian Lu, John Lach, Kevin Skadron, M...
RTSS
1992
IEEE
14 years 13 hour ago
Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
Kevin Jeffay