Sciweavers

1431 search results - page 124 / 287
» Solving Constraints in Model Transformations
Sort
View
EVOW
2007
Springer
15 years 7 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
GECCO
2005
Springer
219views Optimization» more  GECCO 2005»
15 years 6 months ago
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
Yourim Yoon, Yong-Hyuk Kim, Byung Ro Moon
103
Voted
IBPRIA
2005
Springer
15 years 6 months ago
An Algorithm for the Detection of Multiple Concentric Circles
This paper presents a method for the detection of multiple concentric circles which is based on the Hough Transform (HT). In order to reduce time and memory space the concentric ci...
Margarida Silveira
130
Voted
GLOBECOM
2010
IEEE
14 years 11 months ago
Admission Control and Channel Allocation for Supporting Real-Time Applications in Cognitive Radio Networks
Abstract--Proper admission control in cognitive radio networks is critical in providing QoS guarantees to secondary unlicensed users. In this paper, we study the admission control ...
Feng Wang, Junhua Zhu, Jianwei Huang, Yuping Zhao
111
Voted
ICASSP
2011
IEEE
14 years 4 months ago
An augmented Lagrangian method for video restoration
This paper presents a fast algorithm for restoring video sequences. The proposed algorithm, as opposed to existing methods, does not consider video restoration as a sequence of im...
Stanley H. Chan, Ramsin Khoshabeh, Kristofor B. Gi...