454 search results - page 55 / 91 » On improving approximate solutions by evolutionary algorithm... |
97
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
139
click to vote
ANTSW
2008
Springer
15 years 3 months ago
2008
Springer
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perfor...
111
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
109
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
100
click to vote
ACL
1994
15 years 2 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...