10051 search results - page 308 / 2011 » A Dynamic Separator Algorithm |
180
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
161
click to vote
WABI
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. In this paper we propose a chaining method that can align a draft genomic sequence against a finished genome. We introduce the use of an overlap tree to enhance the state...
179
click to vote
KES
1999
Springer
15 years 11 months ago
1999
Springer
—Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of com...
204
click to vote
CCCG
2003
15 years 8 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
216
click to vote
JSAC
2006
15 years 6 months ago
2006
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...