Sciweavers

1132 search results - page 105 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
UAI
2004
15 years 7 months ago
Discretized Approximations for POMDP with Average Cost
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
Huizhen Yu, Dimitri P. Bertsekas
ICC
2007
IEEE
16 years 22 days ago
Partial Decoding for Synchronous and Asynchronous Gaussian Multiple Relay Channels
— Relaying diversity is a key technology to increase capacity in wireless networks. In this paper, the capacity of a single source-destination wireless channel, aided by a set of...
Aitor del Coso, Christian Ibars
SAS
2007
Springer
16 years 16 days ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
ALGORITHMICA
2008
56views more  ALGORITHMICA 2008»
15 years 6 months ago
Eliminating Cycles in the Discrete Torus
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
Béla Bollobás, Guy Kindler, Imre Lea...
JGT
2008
97views more  JGT 2008»
15 years 6 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena