Sciweavers

2244 search results - page 1 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
ADAC
2008
193views more  ADAC 2008»
13 years 5 months ago
A constrained-optimization based half-quadratic algorithm for robustly fitting sets of linearly parametrized curves
We consider the problem of multiple fitting of linearly parametrized curves, that arises in many computer vision problems such as road scene analysis. Data extracted from images us...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...
ISCI
2010
211views more  ISCI 2010»
13 years 3 months ago
A new heuristic approach for non-convex optimization problems
In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous,...
Rosario Toscano, Patrick Lyonnet
EOR
2010
104views more  EOR 2010»
13 years 2 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
ECAI
2008
Springer
13 years 6 months ago
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 4 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma