Sciweavers

10051 search results - page 200 / 2011
» A Dynamic Separator Algorithm
Sort
View
DATAMINE
2002
114views more  DATAMINE 2002»
15 years 4 months ago
Techniques of Cluster Algorithms in Data Mining
An overview of cluster analysis techniques from a data mining point of view is given. This is done by a strict separation of the questions of various similarity and distance measur...
Johannes Grabmeier, Andreas Rudolph
CF
2009
ACM
15 years 11 months ago
Scheduling dynamic parallelism on accelerators
Resource management on accelerator based systems is complicated by the disjoint nature of the main CPU and accelerator, which involves separate memory hierarhcies, different degr...
Filip Blagojevic, Costin Iancu, Katherine A. Yelic...
SIAMSC
2008
113views more  SIAMSC 2008»
15 years 5 months ago
An Efficient and Robust Method for Simulating Two-Phase Gel Dynamics
We develop a computational method for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of tra...
Grady B. Wright, Robert D. Guy, Aaron L. Fogelson
AICCSA
2007
IEEE
89views Hardware» more  AICCSA 2007»
15 years 11 months ago
Software/Configware Implementation of Combinatorial Algorithms
This paper discusses an approach for solving combinatorial problems by combining software and dynamically reconfigurable hardware (configware). The suggested technique avoids inst...
Iouliia Skliarova, Valery Sklyarov
NETWORKS
2008
15 years 5 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...