24 search results - page 3 / 5 » NP-completeness of the Planar Separator Problems |
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, we concern a swing-up control problem for an n-link revolute planar robot with any one of the joint being a passive joint. The goal of this study is to design and an...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
CDC
2009
IEEE
14 years 5 days ago
2009
IEEE
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...
WADS
2001
Springer
13 years 12 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
TVCG
2010
13 years 5 months ago
2010
—This paper presents the first practical method for “origamizing” or obtaining the folding pattern that folds a single sheet of material into a given polyhedral surface with...