Sciweavers

10304 search results - page 1701 / 2061
» Computer science with the sciences: an emphasis in computati...
Sort
View
ICALP
2005
Springer
16 years 9 days ago
Decidability and Complexity Results for Timed Automata via Channel Machines
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
Parosh Aziz Abdulla, Johann Deneux, Joël Ouak...
ICALP
2005
Springer
16 years 9 days ago
Single-Database Private Information Retrieval with Constant Communication Rate
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
Craig Gentry, Zulfikar Ramzan
ICALP
2005
Springer
16 years 9 days ago
On Dynamic Bit-Probe Complexity
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Corina E. Patrascu, Mihai Patrascu
192
Voted
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
16 years 7 days ago
SATABS: SAT-Based Predicate Abstraction for ANSI-C
SAT-based Predicate Abstraction for ANSI-C Edmund Clarke1 Daniel Kroening2 Natasha Sharygina1,3 Karen Yorav4 1 Carnegie Mellon University, School of Computer Science 2 ETH Zuerich,...
Edmund M. Clarke, Daniel Kroening, Natasha Sharygi...
SIGCSE
2004
ACM
132views Education» more  SIGCSE 2004»
16 years 6 days ago
Using game days to teach a multiagent system class
Multiagent systems is an attractive problem solving approach that is becoming ever more feasible and popular in today’s world. It combines artificial intelligence (AI) and distr...
Leen-Kiat Soh
« Prev « First page 1701 / 2061 Last » Next »