Sciweavers

14165 search results - page 244 / 2833
» The generalized two-server problem
Sort
View
131
Voted
JUCS
2006
94views more  JUCS 2006»
15 years 6 months ago
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
Tobias Riege, Jörg Rothe
TIT
2008
90views more  TIT 2008»
15 years 6 months ago
On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
194
Voted
MOR
2000
162views more  MOR 2000»
15 years 6 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
SIAMCO
2000
124views more  SIAMCO 2000»
15 years 6 months ago
A New Suboptimal Approach to the Filtering Problem for Bilinear Stochastic Differential Systems
The aim of this paper is to present a new approach to the filtering problem for the class of bilinear stochastic multivariable systems, consisting in searching for suboptimal state...
Francesco Carravetta, Alfredo Germani, Marat K. Sh...
FOCS
2005
IEEE
15 years 11 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks