Sciweavers

582 search results - page 14 / 117
» Analysis of Grain's Initialization Algorithm
Sort
View
WSC
1998
13 years 8 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan
AAAI
1993
13 years 8 months ago
Complexity Analysis of Real-Time Reinforcement Learning
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
Sven Koenig, Reid G. Simmons
AUTOMATICA
2005
82views more  AUTOMATICA 2005»
13 years 7 months ago
Consistency analysis of some closed-loop subspace identification methods
We study statistical consistency of two recently proposed subspace identification algorithms for closed-loop systems. These algorithms een as implementations of an abstract state-...
Alessandro Chiuso, Giorgio Picci
IACR
2011
192views more  IACR 2011»
12 years 7 months ago
The Hummingbird-2 Lightweight Authenticated Encryption Algorithm
Hummingbird-2 is an encryption algorithm with a 128-bit secret key and a 64-bit initialization vector. Hummingbird-2 optionally produces an authentication tag for each message proc...
Daniel Engels, Markku-Juhani O. Saarinen, Peter Sc...
SPAA
2003
ACM
14 years 22 days ago
Analysis of link reversal routing algorithms for mobile ad hoc networks
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
Costas Busch, Srikanth Surapaneni, Srikanta Tirtha...