Sciweavers

16504 search results - page 18 / 3301
» New Problems, New Solutions
Sort
View
115
Voted
AMC
2004
105views more  AMC 2004»
15 years 1 months ago
Block matrix Sinc-Galerkin solution of the wind-driven current problem
A block matrix formulation is presented for the Sinc-Galerkin technique applied to the wind-driven current problem from oceanography. The block matrix form is used to determine an...
Sanoe Koonprasert, Kenneth L. Bowers
CPAIOR
2009
Springer
15 years 8 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
IJKESDP
2010
149views more  IJKESDP 2010»
15 years 12 days ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
NIPS
2008
15 years 3 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
STACS
2007
Springer
15 years 8 months ago
Enumerating All Solutions for Constraint Satisfaction Problems
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
Henning Schnoor, Ilka Schnoor