16430 search results - page 742 / 3286 » On Computable Tree Functions |
199
click to vote
AIPS
2008
15 years 9 months ago
2008
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
207
click to vote
IJCAI
2003
15 years 8 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
163
Voted
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
176
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
209
click to vote
IJFCS
2006
15 years 7 months ago
2006
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...