Search Sciweavers | Sciweavers

10

IJCAI
1989

87views Artificial Intelligence» more IJCAI 1989»

Domain Dependence in Parallel Constraint Satisfaction

13 years 6 months ago

We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...

Paul R. Cooper, Michael J. Swain

claim paper

Read More »

18

click to vote

MICS
2007

90views more MICS 2007»

Approximation by Conic Splines

13 years 4 months ago

Download www.loria.fr

Abstract. We show that the complexity of a parabolic or conic spline approximating a suﬃciently smooth curve with non-vanishing curvature to within Hausdorﬀ distance ε is c1ε...

Sunayana Ghosh, Sylvain Petitjean, Gert Vegter

claim paper

Read More »

9

click to vote

CCCG
2007

85views Computational Geometry» more CCCG 2007»

Spiralling and Folding: The Topological View

13 years 6 months ago

Download ovid.cs.depaul.edu

For every n, we construct two arcs in the four-punctured sphere that have at least n intersections and which do not form spirals. This is accomplished in several steps: we ﬁrst ...

Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic

claim paper

Read More »

14

click to vote

DAM
2007

129views more DAM 2007»

Easy and hard instances of arc ranking in directed graphs

13 years 5 months ago

Download kaims.pl

: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...

Dariusz Dereniowski

claim paper

Read More »

8

click to vote

CCCG
2006

92views Computational Geometry» more CCCG 2006»

Minimizing the Number of Arcs Linking a Permutation of Points in the Plane

13 years 6 months ago

Download www.cs.mcgill.ca

Stephane Durocher, Chris Gray, James A. King

claim paper