Sciweavers

3019 search results - page 190 / 604
» Approximating the Domatic Number
Sort
View
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
16 years 26 days ago
Oblivious equilibrium for large-scale stochastic games with unbounded costs
— We study stochastic dynamic games with a large number of players, where players are coupled via their cost functions. A standard solution concept for stochastic games is Markov...
Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintrau...
DLT
2003
15 years 7 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
JCO
2006
103views more  JCO 2006»
15 years 6 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
SPIRE
2010
Springer
15 years 4 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
15 years 6 months ago
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...