Sciweavers

1067 search results - page 171 / 214
» Probabilistic regular graphs
Sort
View
CP
2004
Springer
15 years 11 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
SIGCSE
2000
ACM
193views Education» more  SIGCSE 2000»
15 years 10 months ago
Experimentation with bounded buffer synchronization
Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditio...
Steven Robbins
SCAI
2008
15 years 7 months ago
Troubleshooting when Action Costs are Dependent with Application to a Truck Engine
We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and af...
Håkan Warnquist, Mattias Nyberg, Petter S&au...
ACL
2003
15 years 7 months ago
Unsupervised Learning of Dependency Structure for Language Modeling
This paper presents a dependency language model (DLM) that captures linguistic constraints via a dependency structure, i.e., a set of probabilistic dependencies that express the r...
Jianfeng Gao, Hisami Suzuki
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 7 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan