Sciweavers

784 search results - page 107 / 157
» Relaxing the Value Restriction
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 9 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 8 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 9 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
MFCS
2009
Springer
14 years 3 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
TELETRAFFIC
2007
Springer
14 years 3 months ago
Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...
Saikat Ray, Roch Guérin, Rute Sofia