607 search results - page 9 / 122 » Unifying Exact Completions |
ICAPR
2005
Springer
15 years 4 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
ATAL
2006
Springer
15 years 2 months ago
2006
Springer
We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. ...
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
We present the first complete, exact, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It...
ENDM
2006
14 years 10 months ago
2006
A biplane is a 2-(k(k - 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k...
CPAIOR
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...