358 search results - page 24 / 72 » Report on Generic Case Complexity |
152
click to vote
DAC
2005
ACM
16 years 21 days ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
ROBOCUP
1998
Springer
15 years 4 months ago
1998
Springer
With the attempt to enable robots to play soccer games, the RoboCup challenge poses a demanding standard problem for AI and intelligent robotics research. The rich domain of robot ...
SSDBM
2007
IEEE
15 years 6 months ago
2007
IEEE
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
TOSN
2010
14 years 10 months ago
2010
We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the...
80
Voted
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...