4315 search results - page 189 / 863 » Sorting in linear time |
WSC
2007
13 years 11 months ago
2007
Developing and analyzing schedules is essential for successfully controlling the time aspect of construction projects. The critical path method of scheduling is by far the most wi...
NIPS
2007
13 years 10 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
TAMC
2010
Springer
13 years 7 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...