Sciweavers

5153 search results - page 80 / 1031
» Introduction to Randomized Algorithms
Sort
View
AI
2002
Springer
14 years 9 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
IPPS
2008
IEEE
15 years 4 months ago
Providing flow based performance guarantees for buffered crossbar switches
Buffered crossbar switches are a special type of combined input-output queued switches with each crosspoint of the crossbar having small on-chip buffers. The introduction of cross...
Deng Pan, Yuanyuan Yang
FUIN
2002
109views more  FUIN 2002»
14 years 9 months ago
Another Example of Higher Order Randomness
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability
Verónica Becher, Gregory J. Chaitin
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
15 years 1 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
15 years 3 months ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee