Sciweavers

691 search results - page 24 / 139
» Path Consistency by Dual Consistency
Sort
View
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
13 years 11 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...
DLOG
2007
13 years 10 months ago
Adding ABoxes to a Description Logic with Uniqueness Constraints via Path Agreements
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
Vitaliy L. Khizder, David Toman, Grant E. Weddell
JGT
2006
92views more  JGT 2006»
13 years 7 months ago
Characterization of edge-colored complete graphs with properly colored Hamilton paths
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory...
ML
2008
ACM
152views Machine Learning» more  ML 2008»
13 years 7 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
FUIN
2002
128views more  FUIN 2002»
13 years 7 months ago
PathLog: a Query Language for Schemaless Databases of Partially Labeled Objects
Abstract. In the paper we deal with the problem of modeling and querying information in schemaless databases of partially labeled objects (PLO-DB). Partially labeled objects are us...
Tadeusz Pankowski