14548 search results - page 2517 / 2910 » The Optimal Path-Matching Problem |
176
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
188
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
193
Voted
DNA
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
182
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
182
Voted
SAIG
2000
Springer
15 years 10 months ago
2000
Springer
Extracting information from data, often also called data analysis, is an important scienti c task. Statistical approaches, which use methods from probability theory and numerical a...