Sciweavers

5448 search results - page 467 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
IPPS
2006
IEEE
16 years 28 days ago
Model-based evaluation of search strategies in peer-to-peer networks
This paper exploits a previously developed analytical modeling framework to compare several variations of the basic flooding search strategy in unstructured decentralized peer-to...
Rossano Gaeta, Matteo Sereno
ICDCS
1998
IEEE
15 years 11 months ago
Experience with Secure Multi-Processing in Java
As Java is the preferred platform for the deployment of network computers, it is appealing to run multiple applications on a single Java desktop. We experimented with using the Ja...
Dirk Balfanz, Li Gong
CONCUR
2010
Springer
15 years 7 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
PPSN
2010
Springer
15 years 5 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
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...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
CLOUDCOM
2010
Springer
15 years 3 months ago
Scheduling Hadoop Jobs to Meet Deadlines
User constraints such as deadlines are important requirements that are not considered by existing cloud-based data processing environments such as Hadoop. In the current implementa...
Kamal Kc, Kemafor Anyanwu