Sciweavers

4432 search results - page 126 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
COLOGNETWENTE
2010
14 years 12 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
KES
2008
Springer
15 years 3 months ago
Knowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
Hitoshi Kanoh, Yuusuke Sakamoto
ATAL
2008
Springer
15 years 5 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
ATMOS
2007
152views Optimization» more  ATMOS 2007»
15 years 4 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
TEC
2008
109views more  TEC 2008»
15 years 3 months ago
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems
Many areas in power systems require solving one or more nonlinear optimization problems. While analytical methods might suffer from slow convergence and the curse of dimensionality...
Y. del Valle, Ganesh K. Venayagamoorthy, Salman Mo...