Sciweavers

2905 search results - page 199 / 581
» Formal Memetic Algorithms
Sort
View
85
Voted
ICFP
2001
ACM
16 years 19 days ago
Contification Using Dominators
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
Matthew Fluet, Stephen Weeks
TACAS
2009
Springer
106views Algorithms» more  TACAS 2009»
15 years 7 months ago
Hierarchical Set Decision Diagrams and Regular Models
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
Yann Thierry-Mieg, Denis Poitrenaud, Alexandre Ham...
128
Voted
IPPS
2007
IEEE
15 years 7 months ago
A Model for Large Scale Self-Stabilization
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
Thomas Hérault, Pierre Lemarinier, Olivier ...
73
Voted
ICRA
2006
IEEE
88views Robotics» more  ICRA 2006»
15 years 6 months ago
A Method of Cooperative Control using Occasional non-local Interactions
— Current approaches to distributed control involving many robots generally restrict interactions to pairs of robots within a threshold distance. While this allows for provable s...
Brian Shucker, Todd D. Murphey, John K. Bennett
126
Voted
LICS
2006
IEEE
15 years 6 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson