Sciweavers

245 search results - page 33 / 49
» Finding common structured patterns in linear graphs
Sort
View
COCOA
2007
Springer
15 years 3 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
57
Voted
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
15 years 2 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon
NIPS
2004
14 years 11 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
WADS
2007
Springer
121views Algorithms» more  WADS 2007»
15 years 3 months ago
Cauchy's Theorem and Edge Lengths of Convex Polyhedra
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
AAAI
2010
14 years 9 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher