681 search results - page 100 / 137 » General Polynomial Time Decomposition Algorithms |
SIGECOM
2010
ACM
13 years 11 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
ICDT
2010
ACM
14 years 3 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
STACS
2009
Springer
14 years 5 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
PODC
2010
ACM
14 years 2 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
WWW
2005
ACM
14 years 11 months ago
2005
ACM
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...