Sciweavers

511 search results - page 36 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
IEEEPACT
2007
IEEE
15 years 4 months ago
Automatic Correction of Loop Transformations
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...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
VLSISP
2002
112views more  VLSISP 2002»
14 years 9 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
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...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
IPPS
1999
IEEE
15 years 1 months ago
Mapping Media Streams onto a Network of Servers
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...
Reinhard Lüling
ANOR
2005
72views more  ANOR 2005»
14 years 9 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: 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...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 3 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—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...
Denis Bertrand, Olivier Gascuel