4110 search results - page 3 / 822 » Efficient algorithms for the 2-gathering problem |
IPCO
1993
13 years 8 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
FUN
2007
Springer
13 years 11 months ago
2007
Springer
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
ENTCS
2002
13 years 7 months ago
2002
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
ECCV
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
AICOM
2004
13 years 7 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...