Sciweavers

4894 search results - page 927 / 979
» Dynamic Abstraction Planning
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
14 years 10 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
IT
2008
159views more  IT 2008»
14 years 10 months ago
Service Oriented Architecture - Overview of Technologies and Standards
provides a powerful abstraction basically allowing to perceiving all compute resources as entities that can be dynamically discovered and composed. These entities are called servic...
Dimka Karastoyanova, Frank Leymann
ENTCS
2007
113views more  ENTCS 2007»
14 years 9 months ago
Modular Checkpointing for Atomicity
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...
Lukasz Ziarek, Philip Schatz, Suresh Jagannathan
ANSOFT
2002
126views more  ANSOFT 2002»
14 years 9 months ago
The Real-Time Process Algebra (RTPA)
Abstract. The real-time process algebra (RTPA) is a set of new mathematical notations for formally describing system architectures, and static and dynamic behaviors. It is recogniz...
Yingxu Wang
NABIC
2010
14 years 4 months ago
Regional ACO-based routing for load-balancing in NoC systems
Abstract--Ant Colony Optimization (ACO) is a problemsolving technique that was inspired by the related research on the behavior of real-world ant colony. In the domain of Network-o...
Hsien-Kai Hsin, En-Jui Chang, Chih-Hao Chao, An-Ye...