Sciweavers

5595 search results - page 859 / 1119
» Comparing Subsumption Optimizations
Sort
View
SAC
2004
ACM
16 years 10 days ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
SAC
2004
ACM
16 years 10 days ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
SIGIR
2004
ACM
16 years 10 days ago
Locality preserving indexing for document representation
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
Xiaofei He, Deng Cai, Haifeng Liu, Wei-Ying Ma
AMEC
2004
Springer
16 years 10 days ago
Bidding for Customer Orders in TAC SCM
Abstract. Supply chains are a current, challenging problem for agentbased electronic commerce. Motivated by the Trading Agent Competition Supply Chain Management (TAC SCM) scenario...
David Pardoe, Peter Stone
CLEF
2004
Springer
16 years 9 days ago
ImageCLEF 2004: Combining Image and Multi-lingual Search for Medical Image Retrieval
This article describes the technologies used for the various runs submitted by the University of Geneva in the context of the 2004 ImageCLEF competition. As our expertise is mainly...
Henning Müller, Antoine Geissbühler, Pat...