Sciweavers

3758 search results - page 30 / 752
» A Complete Subsumption Algorithm
Sort
View
IPL
2010
79views more  IPL 2010»
13 years 6 months ago
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
Christophe Crespelle, Philippe Gambette
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
14 years 8 days ago
An exploration strategy by constructing Voronoi diagrams with provable completeness
— We present novel exploration algorithms and a control law that enable the construction of Voronoi diagrams over unknown areas using a single autonomous vehicle equipped with ra...
Jonghoek Kim, Fumin Zhang, Magnus Egerstedt
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 2 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
JDA
2007
83views more  JDA 2007»
13 years 7 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 11 months ago
Rank Aggregation via Nuclear Norm Minimization
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
David F. Gleich, Lek-Heng Lim