549 search results - page 56 / 110 » The corner arc algorithm |
NETWORKS
2006
14 years 11 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
102
click to vote
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
108
Voted
ICRA
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract— An estimation algorithm is developed for determining pitch and roll angles (tilt) of a rigid body fixed at a pivot using multiple accelerometers. The estimate is globa...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
103
click to vote
IJCAI
2007
15 years 18 days ago
2007
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...