Sciweavers

6976 search results - page 366 / 1396
» The Oil Searching Problem
Sort
View
COMGEO
2004
ACM
15 years 6 months ago
A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
16 years 9 days ago
Niching in evolution strategies
Evolutionary Algorithms (EAs), popular search methods for solving search and optimization problems, are known for successful and fast location of single optimal solutions. However,...
Ofer M. Shir, Thomas Bäck
WINE
2005
Springer
139views Economy» more  WINE 2005»
16 years 8 days ago
Price of Anarchy, Locality Gap, and a Network Service Provider Game
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, V...
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
15 years 7 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
IJFCS
2006
87views more  IJFCS 2006»
15 years 6 months ago
Flexible Music Retrieval in Sublinear Time
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...