Sciweavers

976 search results - page 136 / 196
» The Complexity of Timetable Construction Problems
Sort
View
IJCAI
1993
13 years 10 months ago
Provably Bounded Optimal Agents
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
Stuart J. Russell, Devika Subramanian, Ronald Parr
ASE
2004
137views more  ASE 2004»
13 years 8 months ago
Automatically Restructuring Programs for the Web
The construction of interactive server-side Web applications differs substantially from the construction of traditional interactive programs. In contrast, existing Web programming...
Jacob Matthews, Robert Bruce Findler, Paul T. Grau...
ESORICS
2009
Springer
14 years 9 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
ESEC
1999
Springer
14 years 1 months ago
Synergy between Component-Based and Generative Approaches
Building software systems out of pre-fabricated components is a very attractive vision. Distributed Component Platforms (DCP) and their visual development environments bring this v...
Stan Jarzabek, Peter Knauber
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...