3875 search results - page 420 / 775 » Approximation algorithms for the 0-extension problem |
220
click to vote
SIAMIS
2011
15 years 1 months ago
2011
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
180
Voted
SECON
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
221
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
203
click to vote
AMAI
2004
Springer
16 years 5 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
215
click to vote
MOC
2011
15 years 1 months ago
2011
Abstract. Various applications in uid dynamics and computational continuum mechanics motivate the development of reliable and e cient adaptive algorithms for mixed nite element m...