908 search results - page 151 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
112
click to vote
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
126
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we present an evolutionary approach for inferring the structure and dynamics in gene circuits from observed expression kinetics. For representing the regulatory inte...
110
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Recognition of motifs in multiple unaligned sequences provides an insight into protein structure and function. The task of discovering these motifs is very challenging because mos...
115
click to vote
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
100
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...