Sciweavers

2244 search results - page 108 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 11 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...

Publication
700views
17 years 2 months ago
Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
David Mumford and Jayant Shah
CP
2003
Springer
15 years 11 months ago
Redundant Modeling for the QuasiGroup Completion Problem
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
Iván Dotú, Alvaro del Val, Manuel Ce...
ICAI
2003
15 years 7 months ago
Exploiting the Marginal Profits of Constraints with Evolutionary Multi-Objective Optimization Techniques
Many real-world search and optimization problems naturally involve constraint handling. Recently, quite a few heuristic methods were proposed to solve the nonlinear constrained op...
Zhenyu Yan, Wei Zhi, Lishan Kang
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
15 years 10 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...