Sciweavers

1933 search results - page 173 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
GLVLSI
2005
IEEE
110views VLSI» more  GLVLSI 2005»
15 years 10 months ago
QCA channel routing with wire crossing minimization
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
Brian Stephen Smith, Sung Kyu Lim
ICRA
2010
IEEE
105views Robotics» more  ICRA 2010»
15 years 2 months ago
On the implementation of single-query sampling-based motion planners
— Single-query sampling-based motion planners are an efficient class of algorithms widely used today to solve challenging motion planning problems. This paper exposes the common...
Ioan Alexandru Sucan, Lydia E. Kavraki
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
15 years 5 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein
RECOMB
2010
Springer
15 years 9 months ago
SubMAP: Aligning Metabolic Pathways with Subnetwork Mappings
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
Ferhat Ay, Tamer Kahveci
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 8 months ago
Combining genetic algorithms with squeaky-wheel optimization
The AI optimization algorithm called "Squeaky-Wheel Optimization" (SWO) has proven very effective in a variety of real-world applications. Although the ideas behind SWO ...
Justin Terada, Hoa Vo, David Joslin