5606 search results - page 785 / 1122 » Randomization Techniques for Graphs. |
178
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
252
click to vote
SAGA
2009
Springer
16 years 1 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
169
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
167
click to vote
GECCO
2007
Springer
16 years 28 days ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing ļ¬eld where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
201
click to vote
IROS
2006
IEEE
16 years 23 days ago
2006
IEEE
ā We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...