Sciweavers

4342 search results - page 72 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
ATAL
2008
Springer
13 years 11 months ago
An improved dynamic programming algorithm for coalition structure generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exh...
Talal Rahwan, Nicholas R. Jennings
EPIA
2007
Springer
14 years 3 months ago
Improving Evolutionary Algorithms with Scouting
The goal of an Evolutionary Algorithm(EA) is to find the optimal solution to a given problem by evolving a set of initial potential solutions. When the problem is multi-modal, an ...
Konstantinos Bousmalis, Gillian M. Hayes, Jeffrey ...
SAC
2004
ACM
14 years 2 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 8 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 9 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen