13376 search results - page 153 / 2676 » Problem Solving with |
113
click to vote
JSAT
2007
15 years 3 months ago
2007
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at mos...
142
click to vote
PAAMS
2009
Springer
15 years 7 months ago
2009
Springer
The multi-agent resource allocation problem is the negotiation of a set of resources among a population of agents, in order to maximize a social welfare function. The purpose of th...
195
click to vote
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
125
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
148
click to vote
INDOCRYPT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...