Sciweavers

1204 search results - page 182 / 241
» Hybrid Probabilistic Programs
Sort
View
ICTAC
2005
Springer
14 years 3 months ago
A Rewriting Logic Sampler
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
José Meseguer
UM
2005
Springer
14 years 3 months ago
Task-Oriented Web User Modeling for Recommendation
Abstract. We propose an approach for modeling the navigational behavior of Web users based on task-level patterns. The discovered “tasks” are characterized probabilistically as...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
AUSAI
2004
Springer
14 years 3 months ago
MML Inference of Oblique Decision Trees
We propose a multivariate decision tree inference scheme by using the minimum message length (MML) principle (Wallace and Boulton, 1968; Wallace and Dowe, 1999). The scheme uses MM...
Peter J. Tan, David L. Dowe
CP
2004
Springer
14 years 3 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
SAT
2004
Springer
95views Hardware» more  SAT 2004»
14 years 3 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke