Sciweavers

3563 search results - page 348 / 713
» Scheduling Algorithms for Procrastinators
Sort
View
ICALP
2005
Springer
16 years 16 days ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 11 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
JCP
2008
155views more  JCP 2008»
15 years 7 months ago
Algorithm to Optimize Code Size and Energy Consumption in Real Time Embedded System
Processor is an important computing element in portable battery operated real time embedded system and it consumes most of the battery energy. Energy consumption, processor memory ...
Santosh D. Chede, Kishore D. Kulat
GEM
2008
15 years 8 months ago
Pseudo-Genetic Algorithmic Composition
This paper presents a realtime music composition system based on a theme and variation approach. The system uses MIDI and allows up to sixteen instruments to play together. Each in...
Harald Schmidl
184
Voted
EOR
2006
120views more  EOR 2006»
15 years 7 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc