976 search results - page 169 / 196 » The Complexity of Timetable Construction Problems |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
SMALLTALK
2007
Springer
14 years 2 months ago
2007
Springer
Concurrency control in Smalltalk is based on locks and is therefore notoriously diļ¬cult to use. Even though some implementations provide high-level constructs, these add complexi...
TPHOL
2005
IEEE
14 years 2 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of ļ¬nite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
TACAS
2005
Springer
14 years 2 months ago
2005
Springer
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
Agent theories and agent programs are two very diļ¬erent styles of speciļ¬cation of agent behavior. The former are declarative in nature, while the latter have an imperative ļ¬...