Sciweavers

1007 search results - page 184 / 202
» The Complexity of Futile Questioning
Sort
View
KR
2004
Springer
14 years 1 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
SEMWEB
2004
Springer
14 years 1 months ago
Dynamic Agent Composition from Semantic Web Services
Abstract. The shift from Web pages to Web services enables programmatic access to the near limitless information on the World Wide Web. Autonomous agents should generate concise an...
Michael Czajkowski, Anna L. Buczak, Martin O. Hofm...
SISW
2003
IEEE
14 years 29 days ago
Memories: A Survey of Their Secure Uses in Smart Cards
— Smart cards are widely known for their tamper resistance, but only contain a small amount of memory. Though very small, this memory often contains highly valuable information (...
Michael Neve, Eric Peeters, David Samyde, Jean-Jac...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 28 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
14 years 27 days ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor