Sciweavers

197 search results - page 10 / 40
» Answering complex questions with random walk models
Sort
View
HICSS
2006
IEEE
152views Biometrics» more  HICSS 2006»
15 years 3 months ago
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
14 years 9 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
FUN
2010
Springer
254views Algorithms» more  FUN 2010»
15 years 2 months ago
The Urinal Problem
Abstract. A man walks into a men’s room and observes n empty urinals. Which urinal should he pick so as to maximize his chances of maintaining privacy, i.e., minimize the chance ...
Evangelos Kranakis, Danny Krizanc
IRI
2006
IEEE
15 years 3 months ago
Environment as support for simplification, reuse and integration of processes in spatial MAS
The development of solutions to complex problems requires finding answers to several questions which are obstacles on the road leading to the solution. To perpetuate progress, the...
Denis Payet, Rémy Courdier, Nicolas S&eacut...
SC
2003
ACM
15 years 2 months ago
Nondeterministic Queries in a Relational Grid Information Service
A Grid Information Service (GIS) stores information about the resources of a distributed computing environment and answers questions about it. We are developing RGIS, a GIS system...
Peter A. Dinda, Dong Lu