1182 search results - page 126 / 237 » Iterative Methods in Combinatorial Optimization |
128
click to vote
EUROCAST
2009
Springer
15 years 9 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
122
click to vote
SARA
2009
Springer
15 years 9 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
124
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
133
click to vote
ICOIN
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
141
click to vote
DAC
1996
ACM
15 years 7 months ago
1996
ACM
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...