Sciweavers

2968 search results - page 296 / 594
» Network Programming Using PLAN
Sort
View
PPOPP
1991
ACM
15 years 7 months ago
Dynamic Node Reconfiguration in a Parallel-Distributed Environment
Idle workstations in a network represent a significant computing potential. In particular, their processing power can be used by parallel-distributed programs that treat the netwo...
Michael J. Feeley, Brian N. Bershad, Jeffrey S. Ch...
141
Voted
PSLS
1995
15 years 7 months ago
Lazy Remote Procedure Call and its Implementation in a Parallel Variant of C
Abstract. Lazy task creation (LTC) is an e cient approach for executing divide and conquer parallel programs that has been used in the implementation of Multilisp's future con...
Marc Feeley
163
Voted
UAI
2008
15 years 5 months ago
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
Sebastian Riedel
INFOCOM
2009
IEEE
15 years 10 months ago
A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...
Zhichao Zhu, Guohong Cao, Sencun Zhu, Supranamaya ...
139
Voted
TGC
2007
Springer
15 years 10 months ago
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computation...
Luigi Liquori, Michel Cosnard