288 search results - page 9 / 58 » Inclusion Problems for Patterns with a Bounded Number of Var... |
IJCAI
1989
13 years 10 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
COLT
2008
Springer
13 years 10 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
EWSA
2004
Springer
14 years 2 months ago
2004
Springer
Software architecture (SA) evaluation is a quality assurance technique that is increasingly attracting significant research and commercial interests. A number of SA evaluation meth...
AOR
2010
13 years 6 months ago
2010
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
CPAIOR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...