Sciweavers

1502 search results - page 173 / 301
» Node weighted scheduling
Sort
View
HPDC
2010
IEEE
15 years 7 months ago
MOON: MapReduce On Opportunistic eNvironments
MapReduce offers a flexible programming model for processing and generating large data sets on dedicated resources, where only a small fraction of such resources are every unavaila...
Heshan Lin, Xiaosong Ma, Jeremy S. Archuleta, Wu-c...
ICDCS
2009
IEEE
16 years 3 months ago
MOPS: Providing Content-Based Service in Disruption-Tolerant Networks
—Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important to network services. However, existing content-based...
Feng Li, Jie Wu
IPSN
2005
Springer
15 years 12 months ago
A scheme for robust distributed sensor fusion based on average consensus
— We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a si...
Lin Xiao, Stephen P. Boyd, Sanjay Lall
ENTCS
2007
190views more  ENTCS 2007»
15 years 6 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
CORR
2012
Springer
214views Education» more  CORR 2012»
14 years 2 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos