3875 search results - page 385 / 775 » Approximation algorithms for the 0-extension problem |
185
click to vote
UAI
2003
15 years 8 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
184
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
184
Voted
IVC
2007
15 years 6 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
176
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
204
click to vote
EMO
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...