2432 search results - page 112 / 487 » Using simple abstraction to reinvent computing for paralleli... |
COORDINATION
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. There are many ways of achieving scalable dynamic web content. In previous work we have focused on dynamic content degradation using a standard architecture and a design-...
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
A new methodology is presented in this paper for resource management in a metacomputing environment using a hierarchy of homogeneous agents that has the capability of service disco...
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We consider the problem of defining the information leakage in interactive systems where secrets and observables can alternate during the computation. We show that the in...
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
CONCUR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...