Sciweavers

3780 search results - page 495 / 756
» Algorithms for Game Metrics
Sort
View
JMLR
2006
96views more  JMLR 2006»
15 years 4 months ago
Rearrangement Clustering: Pitfalls, Remedies, and Applications
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
Sharlee Climer, Weixiong Zhang
JPDC
2006
92views more  JPDC 2006»
15 years 4 months ago
Task assignment in heterogeneous computing systems
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We consider the version in which communicating tasks are to...
Bora Uçar, Cevdet Aykanat, Kamer Kaya, Mura...
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 4 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
TEC
2008
150views more  TEC 2008»
15 years 4 months ago
AbYSS: Adapting Scatter Search to Multiobjective Optimization
We propose the use of a new algorithm to solve multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single objective optimization to...
Antonio J. Nebro, Francisco Luna, Enrique Alba, Be...
CGF
2004
175views more  CGF 2004»
15 years 4 months ago
DiFi: Fast 3D Distance Field Computation Using Graphics Hardware
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
Avneesh Sud, Miguel A. Otaduy, Dinesh Manocha