Sciweavers

5962 search results - page 30 / 1193
» Efficient Clustering for Orders
Sort
View
TOCS
2010
73views more  TOCS 2010»
15 years 8 days ago
Throughput optimal total order broadcast for cluster environments
Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Viv...
246
Voted
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
14 years 5 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
FLAIRS
2004
15 years 3 months ago
Adaptive K-Means Clustering
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering ...
Sanjiv K. Bhatia
182
Voted
ICDE
2004
IEEE
99views Database» more  ICDE 2004»
16 years 3 months ago
An Efficient Framework for Order Optimization
Thomas Neumann, Guido Moerkotte
OPODIS
2004
15 years 3 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh