Sciweavers

4679 search results - page 643 / 936
» The Timely Computing Base Model and Architecture
Sort
View
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
14 years 6 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
AAAI
1994
15 years 8 months ago
Control Strategies for a Stochastic Planner
We present new algorithms for local planning over Markov decision processes. The base-level algorithm possesses several interesting features for control of computation, based on s...
Jonathan Tash, Stuart J. Russell
EUMAS
2006
15 years 8 months ago
Agent Capability: Automating the Design to Code Process
Current IT application domains such as web services and autonomic computing call for highly flexible systems, able to automatically adapt to changing operational environments as w...
Loris Penserini, Anna Perini, Angelo Susi, John My...
PEPM
2007
ACM
16 years 23 days ago
Tasks: language support for event-driven programming
The event-driven programming style is pervasive as an efficient method for interacting with the environment. Unfortunately, the event-driven style severely complicates program mai...
Jeffrey Fischer, Rupak Majumdar, Todd D. Millstein
WISE
2008
Springer
16 years 1 months ago
Approximate Information Filtering in Peer-to-Peer Networks
Abstract. Most approaches to information filtering taken so far have the underlying hypothesis of potentially delivering notifications from every information producer to subscrib...
Christian Zimmer, Christos Tryfonopoulos, Klaus Be...