Sciweavers

4865 search results - page 630 / 973
» The Complexity of Graph Connectivity
Sort
View
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 6 months ago
Dynamic System Adaptation by Constraint Orchestration
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
Luuk Groenewegen, Erik P. de Vink
INFORMATICALT
2006
100views more  INFORMATICALT 2006»
15 years 6 months ago
Optimal Agreement in a Scale-Free Network Environment
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang
JUCS
2002
110views more  JUCS 2002»
15 years 6 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa
ENTCS
2010
118views more  ENTCS 2010»
15 years 3 months ago
Fragments-based Model Reduction: Some Case Studies
Molecular biological models usually suffer from a dramatic combinatorial blow up. Indeed, proteins form complexes and can modify each others, which leads to the formation of a hug...
Jérôme Feret
AOSD
2011
ACM
15 years 1 months ago
Measuring the effects of aspect-oriented refactoring on component relationships: two case studies
Aspect-oriented refactoring is a promising technique for improving modularity and reducing complexity of existing software systems through encapsulating crosscutting concerns. As ...
Reishi Yokomori, Harvey P. Siy, Norihiro Yoshida, ...