Sciweavers

2432 search results - page 465 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
CP
2005
Springer
15 years 3 months ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner
WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
15 years 2 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...
84
Voted
ISCAS
2006
IEEE
133views Hardware» more  ISCAS 2006»
15 years 3 months ago
Neuronal ion-channel dynamics in silicon
Abstract— We present a simple silicon circuit for modelling voltagedependent ion channels found within neural cells, capturing both the gating particle’s sigmoidal activation (...
Kai M. Hynna, Kwabena Boahen
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
15 years 1 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve