Sciweavers

1026 search results - page 102 / 206
» On Finding Minimal w-cutset
Sort
View
CSI
2006
136views more  CSI 2006»
15 years 6 months ago
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
IEICET
2006
55views more  IEICET 2006»
15 years 6 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
VIS
2007
IEEE
80views Visualization» more  VIS 2007»
16 years 7 months ago
Topologically Clean Distance Fields
Analysis of materials obtained from physical simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated...
Attila G. Gyulassy, Mark A. Duchaineau, Vijay Na...
VIS
2005
IEEE
146views Visualization» more  VIS 2005»
16 years 7 months ago
View Selection for Volume Rendering
In a visualization of a three-dimensional dataset, the insights gained are dependent on what is occluded and what is not. Suggestion of interesting viewpoints can improve both the...
Udeepta Bordoloi, Han-Wei Shen
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 6 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson