1985 search results - page 111 / 397 » A Minimal Periods Algorithm with Applications |
115
click to vote
ICCAD
2003
IEEE
16 years 18 days ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
155
click to vote
ICANNGA
2009
Springer
15 years 10 months ago
2009
Springer
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
133
click to vote
HPCC
2009
Springer
15 years 8 months ago
2009
Springer
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
132
Voted
DAM
2007
15 years 3 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
130
click to vote
INFORMS
2006
15 years 3 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...