874 search results - page 45 / 175 » Faster Algorithms for Semi-Matching Problems |
JVCA
2008
14 years 9 months ago
2008
We present an efficient multigrid algorithm that is adequate to solve a heavy linear system given in cloth simulation. Although multigrid has been successfully applied to the Pois...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
COMPGEOM
1998
ACM
15 years 2 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...