Sciweavers

5595 search results - page 478 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
AAAI
2008
15 years 10 months ago
Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
Hai Leong Chieu, Wee Sun Lee
EDBT
2008
ACM
161views Database» more  EDBT 2008»
16 years 7 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
16 years 1 months ago
Transgenetic algorithm: a new evolutionary perspective for heuristics design
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
ICML
2005
IEEE
16 years 8 months ago
Learning from labeled and unlabeled data on a directed graph
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
Bernhard Schölkopf, Dengyong Zhou, Jiayuan Hu...
CLUSTER
2008
IEEE
16 years 2 months ago
Enabling lock-free concurrent fine-grain access to massive distributed data: Application to supernovae detection
—We consider the problem of efficiently managing massive data in a large-scale distributed environment. We consider data strings of size in the order of Terabytes, shared and ac...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé