1686 search results - page 81 / 338 » Programs as polygraphs: computability and complexity |
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
ICSE
2004
IEEE-ACM
15 years 9 months ago
2004
IEEE-ACM
1 Feature Oriented Programming (FOP) is an emerging paradigm for application synthesis, analysis, and optimization. A target application is specified declaratively as a set of feat...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...