Sciweavers

3082 search results - page 42 / 617
» New Bounds for the Controller Problem
Sort
View
100
Voted
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 10 months ago
Multiply-Recursive Upper Bounds with Higman's Lemma
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that re...
Sylvain Schmitz, Philippe Schnoebelen
137
Voted
JGAA
2006
127views more  JGAA 2006»
15 years 3 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
96
Voted
CDC
2008
IEEE
127views Control Systems» more  CDC 2008»
15 years 10 months ago
Output feedback control of linear systems with input and output quantization
— A considerable amount of research has been done on the use of logarithmic quantizers for networked feedback control systems. However, most results are developed for the case of...
Daniel Ferreira Coutinho, Minyue Fu, Carlos E. de ...
141
Voted
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 2 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
127
Voted
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
14 years 10 months ago
Control of a bicycle using virtual holonomic constraints
The problem of making a bicycle trace a strictly convex Jordan curve with bounded roll angle and bounded speed is investigated. The problem is solved by enforcing a virtual holonom...
Luca Consolini, Manfredi Maggiore