5580 search results - page 129 / 1116 » Randomized priority algorithms |
SAT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
SPAA
2000
ACM
15 years 2 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
COCOON
2005
Springer
14 years 12 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— This paper proposes to incorporate bootstrap of data, random feature subspace and evolutionary algorithm with negative correlation learning to automatically design accurate and...
117
click to vote
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...