Sciweavers

202 search results - page 13 / 41
» Complexity of local search for the p-median problem
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 2 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 1 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
TVCG
2011
163views more  TVCG 2011»
13 years 2 months ago
Scan-Based Volume Animation Driven by Locally Adaptive Articulated Registrations
—This paper describes a complete system to create anatomically accurate example-based volume deformation and animation of articulated body regions, starting from multiple in vivo...
Taehyun Rhee, John P. Lewis, Ulrich Neumann, Krish...
MP
2006
134views more  MP 2006»
13 years 7 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
IJCAI
2003
13 years 8 months ago
In the quest of the best form of local consistency for Weighted CSP
The weighted CSP (WCSP) framework is a soft constraint framework with a wide range of applications. In this paper, we consider the problem of maintaining local consistency during ...
Javier Larrosa, Thomas Schiex