2609 search results - page 377 / 522 » Models for Global Constraint Applications |
126
click to vote
CVPR
2009
IEEE
15 years 10 months ago
2009
IEEE
—We present a new 3D reconstruction pipeline for digital preservation of natural and cultural assets. This application requires high quality results, making time and space constr...
137
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
134
Voted
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
141
click to vote
JMLR
2006
15 years 4 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
148
click to vote
MICRO
2010
IEEE
15 years 1 months ago
2010
IEEE
To extend the exponential performance scaling of future chip multiprocessors, improving energy efficiency has become a first-class priority. Single-chip heterogeneous computing ha...