1968 search results - page 116 / 394 » The Complexity of Valued Constraint Models |
134
click to vote
TACAS
2001
Springer
15 years 6 months ago
2001
Springer
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
123
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In background subtraction, cast shadows induce silhouette distortions and object fusions hindering performance of high level algorithms in scene monitoring. We introduce a nonpara...
151
click to vote
CMG
2008
15 years 3 months ago
2008
One of the challenges in building analytic performance models such as queuing network models is obtaining service demands for the various workloads and various devices. While some...
140
click to vote
WSC
2007
15 years 3 months ago
2007
This paper describes two experiments exploring the potential of the Kriging methodology for constrained simulation optimization. Both experiments study an (s, S) inventory system ...
102
click to vote
GD
2005
Springer
15 years 7 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...