1998 search results - page 246 / 400 » Complexity of the Cover Polynomial |
ASIAN
2003
Springer
15 years 6 months ago
2003
Springer
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
TAMC
2010
Springer
15 years 6 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
86
Voted
IPPS
2002
IEEE
15 years 6 months ago
2002
IEEE
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
95
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
98
Voted
ATAL
2001
Springer
15 years 5 months ago
2001
Springer
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...