Sciweavers

6251 search results - page 319 / 1251
» Randomness, Computability, and Density
Sort
View
GLOBECOM
2008
IEEE
16 years 1 months ago
Distributed Multi-Interface Multi-Channel Random Access
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
CONCUR
2007
Springer
16 years 26 days ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
16 years 25 days ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
VOTEID
2007
Springer
16 years 24 days ago
Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator
It is debatable if current direct-recording electronic voting machines can sufficiently be trusted for a use in elections. Reports about malfunctions and possible ways of manipulat...
Jens-Matthias Bohli, Jörn Müller-Quade, ...
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
15 years 10 months ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin