Sciweavers

1631 search results - page 107 / 327
» Uniform Distributed Synthesis
Sort
View
EUROGP
2008
Springer
15 years 4 months ago
Evolving Proactive Aggregation Protocols
We present an approach for the automated synthesis of proactive aggregation protocols using Genetic Programming and discuss major decisions in modeling and simulating distributed a...
Thomas Weise, Michael Zapf, Kurt Geihs
110
Voted
ICALP
2009
Springer
15 years 9 months ago
A Better Algorithm for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
Amin Coja-Oghlan
STACS
2009
Springer
15 years 9 months ago
On the Average Complexity of Moore's State Minimization Algorithm
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
Frédérique Bassino, Julien David, Cy...
ACSD
2005
IEEE
114views Hardware» more  ACSD 2005»
15 years 8 months ago
Controlling Speculative Design Processes Using Rich Component Models
This paper elaborates on the application of some aspects of robust systems control theory to the management of uncertainty and risk in distributed and complex design processes, ha...
Werner Damm
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
15 years 8 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan