413 search results - page 25 / 83 » Synthesis of Distributed Algorithms Using Asynchronous Autom... |
ACSD
2005
IEEE
15 years 3 months ago
2005
IEEE
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
AAAI
2000
14 years 11 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
90
Voted
GRID
2006
Springer
14 years 9 months ago
2006
Springer
Abstract Parallel asynchronous iterative algorithms relax synchronization and communication requirements, and can potentially extend Desktop Grids beyond embarrassingly parallel ap...
86
Voted
COLT
1995
Springer
15 years 1 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
101
click to vote
NEUROSCIENCE
2001
Springer
15 years 1 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...