5580 search results - page 660 / 1116 » Randomized priority algorithms |
153
Voted
SODA
2007
ACM
15 years 6 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
125
click to vote
USENIX
2000
15 years 5 months ago
2000
We examine a policy for managing modem pools that disconnects users only if not enough modems are available for other users to connect. Managing the modem pool then becomes a repl...
134
click to vote
GECCO
2008
Springer
15 years 5 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...
138
click to vote
CN
2008
15 years 4 months ago
2008
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
146
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...