4451 search results - page 119 / 891 » On Random Ordering Constraints |
145
click to vote
IJCAI
1993
15 years 5 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
112
click to vote
DATE
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we present an accurate but very fast soft error rate (SER) estimation technique for digital circuits based on error propagation probability (EPP) computation. Exper...
127
click to vote
ORL
2008
15 years 4 months ago
2008
We consider the problem minX{0,1}n {c x : aj x bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the ...
137
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
162
click to vote
AIPS
2009
15 years 5 months ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...