Sciweavers

5580 search results - page 37 / 1116
» Randomized priority algorithms
Sort
View
81
Voted
EUROGP
2007
Springer
129views Optimization» more  EUROGP 2007»
15 years 3 months ago
Genetic Programming Heuristics for Multiple Machine Scheduling
In this paper we present a method for creating scheduling heuristics for parallel proportional machine scheduling environment and arbitrary performance criteria. Genetic programmin...
Domagoj Jakobovic, Leonardo Jelenkovic, Leo Budin
AINA
2005
IEEE
15 years 3 months ago
Multi-Agent Based Network Management Task Decomposition and Scheduling
The rapid development of Internet makes network management on large-scale network a critical issue. But with the management task of large-scale network becoming more complicated, ...
Bo Liu, Junzhou Luo, Wei Li
CSCLP
2006
Springer
15 years 1 months ago
Distributed Forward Checking May Lie for Privacy
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value...
Ismel Brito, Pedro Meseguer
85
Voted
CORR
2008
Springer
124views Education» more  CORR 2008»
14 years 9 months ago
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
Daniel Raible, Henning Fernau
75
Voted
RANDOM
1999
Springer
15 years 1 months ago
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
Seth Pettie, Vijaya Ramachandran