2957 search results - page 234 / 592 » The Complexity of Polynomial-Time Approximation |
186
click to vote
CMSB
2009
Springer
16 years 1 months ago
2009
Springer
Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic appro...
177
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
159
click to vote
IROS
2007
IEEE
16 years 27 days 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 ...
186
click to vote
PSIVT
2007
Springer
16 years 22 days ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
174
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...