Sciweavers

823 search results - page 81 / 165
» Stateful Subset Cover
Sort
View
MST
2010
187views more  MST 2010»
13 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
ICML
2005
IEEE
14 years 10 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
14 years 10 months ago
Lower bounds for k-DNF resolution on random 3-CNFs
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
Michael Alekhnovich
ICCAD
2001
IEEE
128views Hardware» more  ICCAD 2001»
14 years 7 months ago
An Assembly-Level Execution-Time Model for Pipelined Architectures
The aim of this work is to provide an elegant and accurate static execution timing model for 32-bit microprocessor instruction sets, covering also inter–instruction effects. Suc...
Giovanni Beltrame, Carlo Brandolese, William Forna...
STACS
2010
Springer
14 years 5 months ago
Named Models in Coalgebraic Hybrid Logic
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic sem...
Lutz Schröder, Dirk Pattinson