1480 search results - page 166 / 296 » Distributed algorithms for weighted problems in sparse graph... |
116
Voted
PPAM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
117
Voted
ICDE
2009
IEEE
15 years 7 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
117
click to vote
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
83
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
120
Voted
ASPDAC
2001
ACM
15 years 4 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...