Sciweavers

3192 search results - page 327 / 639
» The minimum latency problem
Sort
View
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
15 years 9 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
15 years 9 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
STOC
1998
ACM
79views Algorithms» more  STOC 1998»
15 years 9 months ago
Multicasting in Heterogeneous Networks
In heterogeneousnetworks sending messagesmay incur different delayson different edges,and eachprocessormay havea different switching timebetweenmessages.Thewell studiedTelephonemo...
Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch S...
ISSS
1996
IEEE
103views Hardware» more  ISSS 1996»
15 years 8 months ago
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
Guido Araujo, Ashok Sudarsanam, Sharad Malik
EURODAC
1994
IEEE
105views VHDL» more  EURODAC 1994»
15 years 8 months ago
On Design Rule Correct Maze Routing
This paper addresses the problem of design rule correct routing, i.e. the avoidance of illegal wiring patterns during routing. These illegal wiring patterns are due to the set of ...
Ed P. Huijbregts, Jos T. J. van Eijndhoven, Jochen...