4110 search results - page 114 / 822 » Efficient algorithms for the 2-gathering problem |
121
click to vote
SIGGRAPH
2010
ACM
15 years 8 months ago
2010
ACM
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for ...
126
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
We formalize the associative bandit problem framework introduced by Kaelbling as a learning-theory problem. The learning environment is modeled as a k-armed bandit where arm payof...
120
click to vote
DAC
1998
ACM
15 years 8 months ago
1998
ACM
Boolean division, and hence Boolean substitution, produces better result than algebraic division and substitution. However, due to the lack of an efficient Boolean division algorit...
123
click to vote
AAAI
1998
15 years 5 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
117
click to vote
DAC
2009
ACM
16 years 5 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...