2168 search results - page 235 / 434 » Randomized Algorithms and Complexity Theory |
142
click to vote
AAAI
1996
15 years 5 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
138
click to vote
COR
2007
15 years 3 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
111
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
122
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
124
Voted
ICPPW
2009
IEEE
15 years 10 months ago
2009
IEEE
—The increasing attention on global scheduling algorithms for identical multiprocessor platforms produced different, independently developed, schedulability tests. However, the e...