Sciweavers

11345 search results - page 1746 / 2269
» Foundations of Computer Science
Sort
View
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
15 years 4 months ago
Formal Correctness Proof for DPLL Procedure
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veriļ...
Filip Maric, Predrag Janicic
ISOLA
2010
Springer
15 years 4 months ago
Seamless Model-Driven Development Put into Practice
SMT—building flexible yet efficient abstraction/refinement solvers. International Journal on Software Tools for Technology Transfer, 12(1):23–37, February 2010. Wolfgang Hab...
Wolfgang Haberl, Markus Herrmannsdoerfer, Stefan K...
LATINCRYPT
2010
15 years 4 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
GIS
2010
ACM
15 years 4 months ago
Moving forward: location privacy and location awareness
ended abstract looks forward at which shared concepts and approaches are shaping future research in the field of location privacy, as well as reflecting on the broader achievement...
Matt Duckham
IEAAIE
2010
Springer
15 years 4 months ago
Modelling Greed of Agents in Economical Context
Abstract. A classical debate in economics addresses the advantages and drawbacks of modelling from a macroeconomics perspective as opposed to modelling from a microeconomics perspe...
Tibor Bosse, Ghazanfar F. Siddiqui, Jan Treur
« Prev « First page 1746 / 2269 Last » Next »