Sciweavers

3142 search results - page 124 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
PPAM
2007
Springer
16 years 13 days ago
Parallel Simulated Annealing Algorithm for Graph Coloring Problem
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swie...
WWW
2008
ACM
16 years 7 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
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 ...
Yunhong Zhou, Victor Naroditskiy
EMO
2003
Springer
137views Optimization» more  EMO 2003»
15 years 11 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle
SEC
2008
15 years 7 months ago
Role Signatures for Access Control in Open Distributed Systems
Implementing access control efficiently and effectively in an open and distributed system is a challenging problem. One reason for this is that users requesting access to remote re...
Jason Crampton, Hoon Wei Lim
NIPS
2004
15 years 7 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson