Sciweavers

151 search results - page 20 / 31
» Parallel computable higher type functionals (Extended Abstra...
Sort
View
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
IAT
2006
IEEE
14 years 1 months ago
Autonomous Mobile Programs
To manage load on large and dynamic networks we have developed Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute. A disadvantage of d...
Xiao Yan Deng, Philip W. Trinder, Greg Michaelson
JGAA
2007
87views more  JGAA 2007»
13 years 7 months ago
A 2.5D Hierarchical Drawing of Directed Graphs
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarass...
ICDCSW
2009
IEEE
14 years 2 months ago
An Approach to Middleware Specialization for Cyber Physical Systems
Contemporary computing infrastructure, such as networking stacks, OS and middleware, are made up of layers of software functionality that have evolved over decades to support the ...
Akshay Dabholkar, Aniruddha S. Gokhale
PPSN
1994
Springer
13 years 11 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob