Sciweavers

2485 search results - page 228 / 497
» A Communicating Tree Model for Generating Network Applicatio...
Sort
View
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 10 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
ICML
2008
IEEE
16 years 4 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
ADHOCNOW
2008
Springer
15 years 10 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...
166
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi
INFOCOM
2006
IEEE
15 years 10 months ago
On the Potential of Structure-Free Data Aggregation in Sensor Networks
— Data aggregation protocols can reduce the cost of communication, thereby extending the lifetime of sensor networks. Prior work on data aggregation protocols has focused on tree...
Kai-Wei Fan, Sha Liu, Prasun Sinha