Sciweavers

1026 search results - page 146 / 206
» On Finding Minimal w-cutset
Sort
View
NIPS
1992
13 years 10 months ago
Hidden Markov Model} Induction by Bayesian Model Merging
This paper describes a technique for learning both the number of states and the topologyof Hidden Markov Models from examples. The inductionprocess starts with the most specific m...
Andreas Stolcke, Stephen M. Omohundro
CADE
2010
Springer
13 years 10 months ago
Sledgehammer: Judgement Day
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
Sascha Böhme, Tobias Nipkow
HICSS
2010
IEEE
187views Biometrics» more  HICSS 2010»
13 years 10 months ago
Navigation Support for Mobile Learning
Mobile learning exposes learning to the natural environment. If this environment is large, the learners have to navigate to find the learning objects or to explore the environment...
Christoph Göth, Gerhard Schwabe
HM
2010
Springer
133views Optimization» more  HM 2010»
13 years 10 months ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 9 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke