2465 search results - page 187 / 493 » Automata on Linear Orderings |
127
Voted
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
— We present a receding horizon optimal control approach for the one-dimensional linear wave equation. In order to prove stability and suboptimality of this approach we use a wei...
106
click to vote
GD
2006
Springer
15 years 4 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
63
Voted
COMBINATORICS
2000
15 years 15 days ago
2000
We provide a much shorter proof of the following partition theorem of P. Erdos and R. Rado: If X is an uncountable linear order into which neither 1 nor 1 embeds, then X (, 4)3 f...
ISCAS
2008
IEEE
15 years 7 months ago
2008
IEEE
—This paper shows how the relative size of components can be used to increase matching performance – saving orders of magnitude in component area. The relative size information...
104
Voted
JAMDS
2002
15 years 10 days ago
2002
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...