1101 search results - page 87 / 221 » heuristics 2007 |
187
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
207
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Biological processes are carried out by coordinated modules of interacting molecules. As clustering methods demonstrate that genes with similar expression display incr...
152
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
179
click to vote
CEC
2007
IEEE
16 years 22 days ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
159
click to vote
DSD
2007
IEEE
16 years 21 days ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...