Sciweavers

3082 search results - page 50 / 617
» New Bounds for the Controller Problem
Sort
View
DAM
2010
66views more  DAM 2010»
15 years 3 months ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
CDC
2008
IEEE
114views Control Systems» more  CDC 2008»
15 years 10 months ago
Dynamic Traveling Repairperson Problem for dynamic systems
— In this paper, we study the Dynamic Traveling Repairman Problem (DTRP) for dynamic systems. In the DTRP, customers are arising dynamically and randomly in a bounded region R, a...
Sleiman Itani, Emilio Frazzoli, Munther A. Dahleh
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
15 years 8 months ago
On the myopic policy for a class of restless bandit problems with applications in dynamic multichannel access
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
Keqin Liu, Qing Zhao
FMCAD
2004
Springer
15 years 9 months ago
Simple Bounded LTL Model Checking
We present a new and very simple translation of the bounded model checking problem which is linear both in the size of the formula and the length of the bound. The resulting CNF-fo...
Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A...
146
Voted
EJC
2008
15 years 3 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias