6546 search results - page 1032 / 1310 » Improving the Performance of the RISE Algorithm |
164
click to vote
PLDI
2004
ACM
15 years 10 months ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
148
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
144
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
168
Voted
ASIAN
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
140
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...