908 search results - page 113 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
126
Voted
WABI
2009
Springer
15 years 10 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
151
Voted
ISSS
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
127
Voted
EOR
2006
15 years 3 months ago
2006
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
145
Voted
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
143
Voted
FPL
2003
Springer
15 years 8 months ago
2003
Springer
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...