13603 search results - page 90 / 2721 » On the Computational Complexity of Cut-Reduction |
180
click to vote
CDC
2010
IEEE
15 years 13 days ago
2010
IEEE
In the perspective next generation Air Traffic Management (ATM) systems, aircraft will be endowed with part of the responsibility for separation maintenance, and traffic complexity...
177
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
181
click to vote
CIE
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization...
232
click to vote
AAAI
2012
13 years 8 months ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
167
click to vote
WSCG
2004
15 years 7 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...