1263 search results - page 148 / 253 » A* with Bounded Costs |
TCOM
2011
13 years 4 months ago
2011
—To lower costs, WDM PONs may share the usage of wavelengths, transmitters, and receivers among ONUs, instead of dedicating the transmission between OLT and each ONU with one ind...
TVCG
2011
13 years 4 months ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
AAAI
2012
12 years 14 hour ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
ECCV
2004
Springer
14 years 11 months ago
2004
Springer
Abstract. We consider the problem of estimating the shape and radiance of a scene from a calibrated set of images under the assumption that the scene is Lambertian and its radiance...