672 search results - page 27 / 135 » A General Solution to the Graph History Interaction Problem |
ENTCS
2008
13 years 7 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
INFORMATICALT
2000
13 years 7 months ago
2000
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
ICONFERENCE
2011
13 years 2 months ago
2011
To develop a science of small-group interaction in groupware, we need a method for analyzing the structure of computer-mediated discourse. Conversation analysis offers an analysis...
CP
2000
Springer
13 years 12 months ago
2000
Springer
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...