9325 search results - page 98 / 1865 » The decentralized implementability problem |
DAGSTUHL
2007
14 years 11 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
FPL
2005
Springer
15 years 3 months ago
2005
Springer
The paper analyses and compares alternative iterative and recursive implementations of FPGA circuits for various problems. Two types of recursive calls have been examined, namely ...
FORMATS
2004
Springer
15 years 3 months ago
2004
Springer
In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We sh...
EUROPAR
2007
Springer
15 years 4 months ago
2007
Springer
Iterated Runge-Kutta (IRK) methods are a class of explicit solution methods for initial value problems of ordinary differential equations (ODEs) which possess a considerable poten...
FCCM
2005
IEEE
15 years 3 months ago
2005
IEEE
The CLA-EC is a model obtained by combining the concepts of cellular learning automata and evolutionary algorithms. The parallel structure of the CLA-EC makes it suitable for hard...