Sciweavers

2981 search results - page 459 / 597
» Answer Set Planning
Sort
View
GC
2008
Springer
15 years 6 months ago
Almost Given Length Cycles in Digraphs
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
Raphael Yuster
CORR
2006
Springer
130views Education» more  CORR 2006»
15 years 6 months ago
On optimal quantization rules for some sequential decision problems
We consider the problem of sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
ENTCS
2006
115views more  ENTCS 2006»
15 years 6 months ago
Distributed Reactive XML
XML-centric models of computation have been proposed as an answer to the demand for interoperability, heterogeneity and openness in coordination models. We present a prototype imp...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen,...
IJET
2008
108views more  IJET 2008»
15 years 6 months ago
Moving towards a Fully Automatic Knowledge Assessment Tool
Information about a student's level or state of knowledge is a key aspect for efficient, personalized learning activities. E-learning systems gain such information in two ways...
Christian Guetl
IJRR
2008
107views more  IJRR 2008»
15 years 6 months ago
Caging Polygons with Two and Three Fingers
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
Mostafa Vahedi, A. Frank van der Stappen