840 search results - page 91 / 168 » Inapproximability of Combinatorial Optimization Problems |
94
Voted
CCIA
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we extend the notion of multi-unit combinatorial reverse auction by adding a new dimension to the goods at auction. In such a new type of combinatorial auction a buye...
120
Voted
GECCO
2010
Springer
14 years 9 months ago
2010
Springer
Large software companies have to plan their project portfolio to maximize potential portfolio return and strategic alignment, while balancing various preferences, and considering ...
116
Voted
GPEM
2002
15 years 6 days ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
116
click to vote
ICPP
2002
IEEE
15 years 5 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
108
click to vote
TEC
2002
15 years 2 days ago
2002
The clonal selection principle is used to explain the basic features of an adaptive immune response to an antigenic stimulus. It establishes the idea that only those cells that rec...