Sciweavers

9842 search results - page 179 / 1969
» Problem complexity
Sort
View
159
Voted
DISOPT
2011
210views Education» more  DISOPT 2011»
14 years 9 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
AAAI
1990
15 years 3 months ago
A Design Based Approach to Constructing Computational Solutions to Diagnostic Problems
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
D. Volovik, Imran A. Zualkernan, Paul E. Johnson, ...
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
15 years 7 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
STACS
2010
Springer
15 years 9 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
Dániel Marx, Barry O'Sullivan, Igor Razgon
ESANN
1998
15 years 3 months ago
A neural approach to a sensor fusion problem
Our problem concerns the joint interpretation of UltraSonic and InfraRed measurements provided by a composite proximity sensor, in order to extract geometrical and morphological f...
Valentina Colla, Mirko Sgarbi, Leonardo Maria Reyn...