2313 search results - page 186 / 463 » On Heuristic Time Hierarchies |
167
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
206
click to vote
SI3D
2012
ACM
14 years 2 months ago
2012
ACM
Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting ...
192
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
Coalition formation methods allow agents to join together and are thus necessary in cases where tasks can only be performed cooperatively by groups. This is the case in the Reques...
150
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
168
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
With device counts on modern-day ASICs crossing the 10 million mark, careful planning of an ASIC design project is necessary to meet time deadlines. Two problems arise in this con...