Sciweavers

1327 search results - page 188 / 266
» Path following algorithm for the graph matching problem
Sort
View
JACM
2006
134views more  JACM 2006»
15 years 1 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
14 years 8 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely
111
Voted
COCOON
2007
Springer
15 years 8 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav
IROS
2009
IEEE
128views Robotics» more  IROS 2009»
15 years 8 months ago
Motion planning for active cannulas
— An active cannula is a medical device composed of thin, pre-curved, telescoping tubes that may enable many new surgical procedures. Planning optimal motions for these devices i...
Lisa A. Lyons, Robert J. Webster, Ron Alterovitz
INFOCOM
2009
IEEE
15 years 8 months ago
Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints
Continuous monitoring and diagnosis of network performance are of crucial importance for the Internet access service and virtual private network (VPN) service providers. Various o...
Yao Zhao, Zhaosheng Zhu, Yan Chen, Dan Pei, Jia Wa...