Sciweavers

970 search results - page 150 / 194
» On encodings of spanning trees
Sort
View
IEAAIE
1995
Springer
14 years 2 months ago
Modelling Hybrid Rule/Frame-Based Expert Systems Using Coloured Petri Nets
High level Petri Nets have recently been used for many AI applications, particularly for modelling traditional rule-based expert systems. The major effect is to facilitate the ana...
Simon C. K. Shiu, James N. K. Liu, Daniel S. Yeung
IDA
2010
Springer
14 years 24 days ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
14 years 13 days ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
PDPTA
2007
14 years 13 days ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker
ACID
2006
220views Algorithms» more  ACID 2006»
14 years 12 days ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove