Sciweavers

1816 search results - page 63 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
SIAMCOMP
2008
148views more  SIAMCOMP 2008»
15 years 4 months ago
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
Achour Mostéfaoui, Sergio Rajsbaum, Michel ...
CP
2007
Springer
15 years 9 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
RECOMB
2005
Springer
16 years 6 months ago
Segmentation Conditional Random Fields (SCRFs): A New Approach for Protein Fold Recognition
Abstract. Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e. segmenta...
Yan Liu, Jaime G. Carbonell, Peter Weigele, Vanath...
CEC
2007
IEEE
15 years 10 months ago
Solving, rating and generating Sudoku puzzles with GA
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
Timo Mantere, Janne Koljonen
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
16 years 2 days ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel