970 search results - page 150 / 194 » On encodings of spanning trees |
105
click to vote
IEAAIE
1995
Springer
15 years 4 months ago
1995
Springer
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...
94
Voted
IDA
2010
Springer
15 years 2 months ago
2010
Springer
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...
113
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
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 ...
100
Voted
PDPTA
2007
15 years 1 months ago
2007
- 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...
197
click to vote
ACID
2006
15 years 1 months ago
2006
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...