Sciweavers

549 search results - page 56 / 110
» The corner arc algorithm
Sort
View
127
Voted
NETWORKS
2006
15 years 2 months ago
The multiroute maximum flow problem revisited
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...
Donglei Du, R. Chandrasekaran
135
Voted
CORR
2010
Springer
175views Education» more  CORR 2010»
14 years 11 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...
148
Voted
ICRA
2010
IEEE
179views Robotics» more  ICRA 2010»
15 years 1 months ago
Accelerometer-based tilt estimation of a rigid body with only rotational degrees of freedom
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...
Sebastian Trimpe, Raffaello D'Andrea
112
Voted
ICALP
2010
Springer
15 years 6 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
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...
Loukas Georgiadis
134
Voted
IJCAI
2007
15 years 4 months ago
The Logic Behind Weighted CSP
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...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...