Sciweavers

4843 search results - page 258 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
124
Voted
ICRA
2006
IEEE
95views Robotics» more  ICRA 2006»
15 years 9 months ago
Discrete Approximations to Continuous Curves
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
Sean B. Andersson
116
Voted
ZUM
2005
Springer
142views Formal Methods» more  ZUM 2005»
15 years 9 months ago
Formal Program Development with Approximations
Abstract. We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by reso...
Eerke A. Boiten, John Derrick
114
Voted
FMCAD
2004
Springer
15 years 9 months ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl
128
Voted
GECCO
2004
Springer
15 years 9 months ago
Multi-branches Genetic Programming as a Tool for Function Approximation
This work presents a performance analysis of a Multi-Branches Genetic Programming (MBGP) approach applied in symbolic regression (e.g. function approximation) problems. Genetic Pro...
Katya Rodríguez-Vázquez, Carlos Oliv...
153
Voted
DATE
2009
IEEE
107views Hardware» more  DATE 2009»
15 years 7 months ago
Sequential logic rectifications with approximate SPFDs
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...
Yu-Shen Yang, Subarna Sinha, Andreas G. Veneris, R...