Sciweavers

165 search results - page 23 / 33
» Exotic Quantifiers, Complexity Classes, and Complete Problem...
Sort
View
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 9 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
JPDC
2007
167views more  JPDC 2007»
13 years 7 months ago
On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on mesh-based multiprocessor architectures. As the ...
Diana H. P. Low, Bharadwaj Veeravalli, David A. Ba...
PVLDB
2008
121views more  PVLDB 2008»
13 years 6 months ago
Type inference and type checking for queries on execution traces
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
Daniel Deutch, Tova Milo
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 7 months ago
Zero-knowledge against quantum attacks
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...
John Watrous
PATAT
1997
Springer
107views Education» more  PATAT 1997»
13 years 11 months ago
A Comparison of Annealing Techniques for Academic Course Scheduling
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simu...
M. A. Saleh Elmohamed, Paul D. Coddington, Geoffre...