403 search results - page 2 / 81 » Variable ranges in linear constraints |
ORL
2010
13 years 2 months ago
2010
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N(
JAIR
2011
13 years 2 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
MICAI
2004
Springer
14 years 21 days ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
SAS
2007
Springer
14 years 1 months ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...