Sciweavers

201 search results - page 2 / 41
» An Authorization Logic With Explicit Time
Sort
View
IJCAI
1993
13 years 6 months ago
The Range of Applicability of Nonmonotonic Logics for the Inertia Problem
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...
Erik Sandewall
CCS
2007
ACM
13 years 10 months ago
Alpaca: extensible authorization for distributed services
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them wi...
Chris Lesniewski-Laas, Bryan Ford, Jacob Strauss, ...
12
Voted
PADS
1997
ACM
13 years 8 months ago
Distributed Simulation of Spatially Explicit Ecological Models
Large-scale ecological simulations are natural candidates for distributed discrete event simulation. In optimistic simulation of spatially explicit models, a difficult problem ar...
Kevin Glass, Marilynn Livingston, John S. Conery
TIT
2008
110views more  TIT 2008»
13 years 4 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
ITS
2004
Springer
130views Multimedia» more  ITS 2004»
13 years 10 months ago
Opening the Door to Non-programmers: Authoring Intelligent Tutor Behavior by Demonstration
Abstract. Intelligent tutoring systems are quite difficult and time intensive to develop. In this paper, we describe a method and set of software tools that ease the process of cog...
Kenneth R. Koedinger, Vincent Aleven, Neil T. Heff...