Sciweavers

1589 search results - page 21 / 318
» Constraints with Variables' Annotations
Sort
View
CP
2000
Springer
14 years 29 days ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 8 months ago
Synchronization recovery and state model reduction for soft decoding of variable length codes
Abstract-- Variable length codes (VLCs) exhibit desynchronization problems when transmitted over noisy channels. Trellis decoding techniques based on Maximum A Posteriori (MAP) est...
Simon Malinowski, Herve Jegou, Christine Guillemot
CPAIOR
2004
Springer
14 years 2 months ago
Super Solutions in Constraint Programming
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
WCET
2008
13 years 10 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
NIPS
2007
13 years 10 months ago
Expectation Maximization and Posterior Constraints
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
João Graça, Kuzman Ganchev, Ben Task...