4843 search results - page 258 / 969 » The Shortcut Problem - Complexity and Approximation |
154
click to vote
ICRA
2006
IEEE
16 years 18 days ago
2006
IEEE
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...
155
click to vote
ZUM
2005
Springer
16 years 1 days ago
2005
Springer
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...
148
click to vote
FMCAD
2004
Springer
15 years 12 months ago
2004
Springer
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...
170
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
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...
193
click to vote
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
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...