110 search results - page 11 / 22 » Chain polynomials and Tutte polynomials |
MST
2008
13 years 7 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
SPIN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to opti...