2465 search results - page 280 / 493 » Automata on Linear Orderings |
97
Voted
SBCCI
2005
ACM
15 years 6 months ago
2005
ACM
In this paper it will be demonstrated, from the theory and measurements, that series-parallel (SP) mirrors allow building current copiers with copy factors of thousands, without d...
100
click to vote
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
102
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
ICANN
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In practice, almost all control systems in use today implement some form of linear control. However, there are many tasks for which conventional control engineering metho...
111
click to vote
IFIP
2005
Springer
15 years 6 months ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...