Sciweavers

1469 search results - page 221 / 294
» A New Migration Model For Distributed Genetic Algorithms
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 10 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
DEDS
2006
119views more  DEDS 2006»
13 years 9 months ago
Diagnosability of Discrete Event Systems with Modular Structure
The diagnosis of unobservable faults in large and complex discrete event systems modeled by parallel composition of automata is considered. A modular approach is developed for diag...
Olivier Contant, Stéphane Lafortune, Demost...
DC
2007
13 years 9 months ago
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...
Josef Widder, Ulrich Schmid
SMA
2008
ACM
139views Solid Modeling» more  SMA 2008»
13 years 9 months ago
An incremental approach to feature aligned quad dominant remeshing
In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad-dominant mesh with edges aligned to the principal directions of the underlying geome...
Yu-Kun Lai, Leif Kobbelt, Shi-Min Hu
EUROPAR
2010
Springer
13 years 10 months ago
Estimating and Exploiting Potential Parallelism by Source-Level Dependence Profiling
Manual parallelization of programs is known to be difficult and error-prone, and there are currently few ways to measure the amount of potential parallelism in the original sequent...
Jonathan Mak, Karl-Filip Faxén, Sverker Jan...