511 search results - page 36 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
169
click to vote
IEEEPACT
2007
IEEE
16 years 8 days ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
171
click to vote
VLSISP
2002
15 years 5 months ago
2002
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
152
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
149
click to vote
ANOR
2005
15 years 5 months ago
2005
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
139
click to vote
WABI
2004
Springer
15 years 11 months ago
2004
Springer
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...