Sciweavers

923 search results - page 140 / 185
» On the Topology of Discrete Strategies
Sort
View
COMPGEOM
2004
ACM
14 years 2 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato
ICRA
2003
IEEE
125views Robotics» more  ICRA 2003»
14 years 2 months ago
Online footstep planning for humanoid robots
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
IPPS
2003
IEEE
14 years 2 months ago
An Analysis of Performance Enhancement Techniques for Overset Grid Applications
The overset grid methodology has significantly reduced time-to-solution of high-fidelity computational fluid dynamics (CFD) simulations about complex aerospace configurations....
M. Jahed Djomehri, Rupak Biswas, Mark Potsdam, Rog...
ITC
2003
IEEE
127views Hardware» more  ITC 2003»
14 years 2 months ago
Architecting Millisecond Test Solutions for Wireless Phone RFIC's
Today’s low cost wireless phones have driven a need to be able to economically test high volumes of complex RF IC’s at a fraction of the cost of the IC. In June of 2001 the IB...
John Ferrario, Randy Wolf, Steve Moss
ICALP
2003
Springer
14 years 2 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper