Sciweavers

203 search results - page 15 / 41
» On the Average Complexity of Moore's State Minimization Algo...
Sort
View
IPL
2011
91views more  IPL 2011»
13 years 3 days ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 2 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
ATAL
2010
Springer
13 years 9 months ago
Learning multi-agent state space representations
This paper describes an algorithm, called CQ-learning, which learns to adapt the state representation for multi-agent systems in order to coordinate with other agents. We propose ...
Yann-Michaël De Hauwere, Peter Vrancx, Ann No...
SIGMETRICS
2009
ACM
165views Hardware» more  SIGMETRICS 2009»
14 years 3 months ago
Understanding intrinsic characteristics and system implications of flash memory based solid state drives
Flash Memory based Solid State Drive (SSD) has been called a “pivotal technology” that could revolutionize data storage systems. Since SSD shares a common interface with the t...
Feng Chen, David A. Koufaty, Xiaodong Zhang
EH
1999
IEEE
351views Hardware» more  EH 1999»
14 years 1 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...