5214 search results - page 96 / 1043 » The Online Specialization Problem |
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
HEURISTICS
2010
13 years 3 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
IWOCA
2010
Springer
13 years 3 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
PRICAI
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. With the development of e-commerce and information access, a large amount of information can be found online, which makes a good recommendation service to be urgently nec...