Sciweavers

2634 search results - page 178 / 527
» Faster Than Uppaal
Sort
View
OPODIS
2001
15 years 7 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
SDM
2004
SIAM
163views Data Mining» more  SDM 2004»
15 years 7 months ago
Basic Association Rules
Previous approaches for mining association rules generate large sets of association rules. Such sets are difficult for users to understand and manage. Here, the concept of a restri...
Guichong Li, Howard J. Hamilton
WSC
2001
15 years 7 months ago
Resource graphs for modeling large-scale, highly congested systems
Simulations often execute too slowly to be effective tools for decision-making. In particular, this problem has been found in semiconductor manufacturing where conventional job-dr...
Paul Hyden, Lee Schruben, Theresa M. Roeder
WSCG
2004
159views more  WSCG 2004»
15 years 7 months ago
A Fast Method for Applying Rigid Transformations to Volume Data
Volume rendering is a widespread method for displaying graphical models in fields such as medical visualization or engineering. The required image information is stored in a volum...
Jan Fischer, Ángel del Río
AAAI
1998
15 years 7 months ago
Optimal 2D Model Matching Using a Messy Genetic Algorithm
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
J. Ross Beveridge