Sciweavers

1364 search results - page 130 / 273
» Collective Optimization
Sort
View
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
14 years 3 months ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya
GECCO
2005
Springer
14 years 3 months ago
Evolving agent swarms for clustering and sorting
Social insect societies consist of individuals with simple behavior, yet at the collective level the societies are capable of solving complex tasks. These tasks span a wide range,...
Vegard Hartmann
DIS
2004
Springer
14 years 3 months ago
Tiling Databases
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
Floris Geerts, Bart Goethals, Taneli Mielikäi...
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
14 years 3 months ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
FOCS
2002
IEEE
14 years 3 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai