10051 search results - page 9 / 2011 » A Dynamic Separator Algorithm |
ALGORITHMS
2010
13 years 4 months ago
2010
MP
2006
13 years 7 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
ICWSM
2010
13 years 8 months ago
2010
In this study, we examine human social interactions within virtual worlds and address the question of how group interactions are affected by the surrounding game environment. To i...
INFOVIS
1999
IEEE
13 years 11 months ago
1999
IEEE
Dynamic Queries offer continuous feedback during range queries, and have been shown to be effective and satisfying. Recent work has extended them to datasets of 100,000 objects an...
CP
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...