Sciweavers

392 search results - page 56 / 79
» Modular Competitiveness for Distributed Algorithms
Sort
View
HPCN
1995
Springer
14 years 1 days ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
IDA
2009
Springer
13 years 6 months ago
Context-Based Distance Learning for Categorical Data Clustering
Abstract. Clustering data described by categorical attributes is a challenging task in data mining applications. Unlike numerical attributes, it is difficult to define a distance b...
Dino Ienco, Ruggero G. Pensa, Rosa Meo
SPAA
2005
ACM
14 years 2 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
ICML
1995
IEEE
14 years 9 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
CEC
2009
IEEE
14 years 1 months ago
A novel EDAs based method for HP model protein folding
— The protein structure prediction (PSP) problem is one of the most important problems in computational biology. This paper proposes a novel Estimation of Distribution Algorithms...
Benhui Chen, Long Li, Jinglu Hu