13603 search results - page 156 / 2721 » On the Computational Complexity of Cut-Reduction |
190
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
167
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
169
Voted
VR
2000
IEEE
15 years 9 months ago
2000
IEEE
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globa...
164
click to vote
ESANN
2003
15 years 7 months ago
2003
Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
165
click to vote
WSCG
2004
15 years 7 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...