Sciweavers

893 search results - page 11 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
IJON
2006
90views more  IJON 2006»
15 years 3 months ago
Reinforcement learning of a simple control task using the spike response model
In this work, we propose a variation of a direct reinforcement learning algorithm, suitable for usage with spiking neurons based on the spike response model (SRM). The SRM is a bi...
Murilo Saraiva de Queiroz, Roberto Coelho de Berr&...
IJHPCA
2010
105views more  IJHPCA 2010»
15 years 1 months ago
A Pipelined Algorithm for Large, Irregular All-Gather Problems
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
Jesper Larsson Träff, Andreas Ripke, Christia...
IJCAI
1989
15 years 4 months ago
Approximation Algorithms for Temporal Reasoning
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
Peter van Beek
PSTV
1993
123views Hardware» more  PSTV 1993»
15 years 4 months ago
On the Verification of Temporal Properties
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
Patrice Godefroid, Gerard J. Holzmann
ISTCS
1992
Springer
15 years 6 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit