Sciweavers

6506 search results - page 772 / 1302
» Algorithmic models for sensor networks
Sort
View
INFOCOM
2005
IEEE
16 years 24 days ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
AP2PC
2004
Springer
16 years 18 days ago
Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
George H. L. Fletcher, Hardik A. Sheth, Katy B&oum...
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
16 years 7 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
ADHOC
2007
159views more  ADHOC 2007»
15 years 7 months ago
Cross-layer adaptive control for wireless mesh networks
Abstract— This paper investigates optimal routing and adaptive scheduling in a wireless mesh network composed of mesh clients and mesh routers. The mesh clients are power constra...
Michael J. Neely, Rahul Urgaonkar
NIPS
2008
15 years 8 months ago
Partially Observed Maximum Entropy Discrimination Markov Networks
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
Jun Zhu, Eric P. Xing, Bo Zhang