Sciweavers

42 search results - page 6 / 9
» Specialising Finite Domain Programs Using Polyhedra
Sort
View
FSTTCS
2010
Springer
15 years 15 days ago
Expressiveness of streaming string transducers
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
Rajeev Alur, Pavol Cerný
135
Voted
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 1 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
POPL
2010
ACM
15 years 12 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
COLT
1994
Springer
15 years 6 months ago
Bayesian Inductive Logic Programming
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
Stephen Muggleton
AAAI
2010
15 years 4 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon