1998 search results - page 254 / 400 » Complexity of the Cover Polynomial |
129
Voted
DISOPT
2010
15 years 27 days ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
100
click to vote
AMAI
2006
Springer
15 years 27 days ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
90
Voted
DAM
2006
15 years 26 days ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
97
Voted
FUIN
2006
15 years 25 days ago
2006
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
120
click to vote
IJCSA
2006
15 years 24 days ago
2006
Analysis of the effect of different parameters of the RC4 encryption algorithm where examined. Some experimental work was performed to illustrate the performance of this algorithm...