365 search results - page 52 / 73 » On the Crossing Spanning Tree Problem |
ACL
1992
13 years 9 months ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
GECCO
2010
Springer
14 years 18 days ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
SOFSEM
1997
Springer
13 years 12 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...