26 search results - page 5 / 6 » Heuristics for a Brokering Set Packing Problem |
IEICET
2006
13 years 6 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
PSB
2004
13 years 7 months ago
2004
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
FOCS
2009
IEEE
14 years 27 days ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...