505 search results - page 74 / 101 » On A Graph Formalism for Ordered Edges |
88
Voted
IJAR
2007
14 years 9 months ago
2007
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— A distributed control law that guarantees connectivity maintenance in a network of multiple mobile agents is presented. The control law respects the limited sensing cap...
ISSS
1999
IEEE
15 years 1 months ago
1999
IEEE
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...
FMCAD
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...