1522 search results - page 166 / 305 » On the Complexity of Several Haplotyping Problems |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
DIGRA
2005
Springer
15 years 3 months ago
2005
Springer
An examination of the contributions that can be made by the field of non-mechanistic cybernetics (as elaborated by Gregory Bateson and Anthony Wilden) to a theory of videogames th...
108
click to vote
DAWAK
2001
Springer
15 years 2 months ago
2001
Springer
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
ICSE
2001
IEEE-ACM
15 years 2 months ago
2001
IEEE-ACM
An emerging tapestry of computations will soon integrate systems around the globe. It will evolve without central control. Its complexity will be vast. We need new ideas, tools an...