Sciweavers

3320 search results - page 292 / 664
» Heuristics for the Phylogeny Problem
Sort
View
GECCO
2008
Springer
142views Optimization» more  GECCO 2008»
15 years 7 months ago
Complexity of Max-SAT using stochastic algorithms
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
Mohamed Qasem, Adam Prügel-Bennett
EOR
2006
76views more  EOR 2006»
15 years 6 months ago
Location of slaughterhouses under economies of scale
The facility location problem described in this paper comes from an industrial application in the slaughterhouse industry of Norway. Investigations show that the slaughterhouse in...
John v. d. Broek, Peter Schütz, Leen Stougie,...
KES
2006
Springer
15 years 6 months ago
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
IJAIT
2007
119views more  IJAIT 2007»
15 years 6 months ago
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Ya...
IEEEHPCS
2010
15 years 5 months ago
3-SAT on CUDA: Towards a massively parallel SAT solver
This work presents the design and implementation of a massively parallel 3-SAT solver, specifically targeting random problem instances. Our approach is deterministic and features ...
Quirin Meyer, Fabian Schonfeld, Marc Stamminger, R...