6365 search results - page 1118 / 1273 » Fast Local Computation Algorithms |
175
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
184
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
170
click to vote
WSCG
2004
15 years 7 months ago
2004
The parametrization of 3-d meshes can be used in many fields of computer graphics. Mesh-texturing, mesh-retriangulation or 3-d morphing are only few applications for which a mesh ...
200
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
171
click to vote
GISCIENCE
2008
Springer
15 years 7 months ago
2008
Springer
Movement patterns, like flocking and converging, leading and following, are examples of high-level process knowledge derived from lowlevel trajectory data. Conventional techniques...