Sciweavers

547 search results - page 75 / 110
» Preference-Based Search for Scheduling
Sort
View
HIPC
2007
Springer
14 years 2 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
14 years 2 months ago
Combining genetic algorithms with squeaky-wheel optimization
The AI optimization algorithm called "Squeaky-Wheel Optimization" (SWO) has proven very effective in a variety of real-world applications. Although the ideas behind SWO ...
Justin Terada, Hoa Vo, David Joslin
FLAIRS
2003
14 years 10 days ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
AI
2005
Springer
13 years 11 months ago
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
Richard J. Wallace, Eugene C. Freuder
ASPDAC
2006
ACM
118views Hardware» more  ASPDAC 2006»
14 years 5 months ago
Task placement heuristic based on 3D-adjacency and look-ahead in reconfigurable systems
To get efficient HW management in 2D Reconfigurable Systems, heuristics are needed to select the best place to locate each arriving task. We propose a technique that locates the ta...
Jesús Tabero, Julio Septién, Hortens...