131 search results - page 20 / 27 » Adversary lower bounds for nonadaptive quantum algorithms |
SPAA
2003
ACM
15 years 4 months ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
104
Voted
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
80
Voted
MFCS
2001
Springer
15 years 4 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
STACS
2007
Springer
15 years 5 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
131
click to vote
CG
2006
Springer
15 years 3 months ago
2006
Springer
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...