Sciweavers

3907 search results - page 490 / 782
» Time, Knowledge, and Choice
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ICALP
2009
Springer
16 years 7 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
247
Voted
SIGMOD
2008
ACM
109views Database» more  SIGMOD 2008»
16 years 6 months ago
Cooperative XPath caching
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...
Kostas Lillis, Evaggelia Pitoura
ICFP
2005
ACM
16 years 6 months ago
Acute: high-level programming language design for distributed computation
Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of ma...
Peter Sewell, James J. Leifer, Keith Wansbrough, F...
MOBISYS
2008
ACM
16 years 6 months ago
Brimon: a sensor network system for railway bridge monitoring
: Railway systems are critical in many regions, and can consist of several tens of thousands of bridges, being used over several decades. It is critical to have a system to monitor...
Kameswari Chebrolu, Bhaskaran Raman, Nilesh Mishra...