Sciweavers

1523 search results - page 109 / 305
» Partially ordered secretaries
Sort
View
ACL
2001
15 years 2 months ago
Topological Dependency Trees: A Constraint-Based Account of Linear Precedence
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
Denys Duchier, Ralph Debusmann
108
Voted
ITA
2008
119views Communications» more  ITA 2008»
15 years 22 days ago
Some Algebraic Properties of Machine Poset of Infinite Words
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
Aleksandrs Belovs
118
Voted
JSYML
2007
100views more  JSYML 2007»
15 years 19 days ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
135
Voted
IEEEICCI
2009
IEEE
15 years 7 months ago
Interval sets and interval-set algebras
An interval set is an interval in the power set lattice based on a universal set and is a family of subsets of the universal set. Interval sets and interval-set algebras provide a...
Yiyu Yao
102
Voted
ICRA
2008
IEEE
141views Robotics» more  ICRA 2008»
15 years 7 months ago
Experimental evaluation of some exploration strategies for mobile robots
— The ability of building maps of environments where they operate is one of the main requirements for autonomous mobile robots. An efficient map building process is based on a g...
Francesco Amigoni