908 search results - page 158 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
102
click to vote
PAAPP
2002
14 years 11 months ago
2002
Abstract. The performance of shared-memory (OpenMP) implementations of three different PDE solver kernels representing finite difference methods, finite volume methods, and spectra...
106
click to vote
C3S2E
2010
ACM
15 years 25 days ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
183
click to vote
SIAMJO
2011
14 years 6 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
101
click to vote
JCB
2007
14 years 11 months ago
2007
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
This paper describes an extension to the Restricted Growth Function grouping Genetic Algorithm applied to the Consensus Clustering of a retinal nerve fibre layer data-set. Consens...