628 search results - page 12 / 126 » The minimum shift design problem |
141
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
120
Voted
ISAAC
2010
Springer
15 years 13 days ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
112
Voted
STOC
1999
ACM
15 years 6 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
102
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper addresses the problem of bit detection for a chaos-based multiple-access system. In particular, one considers the Differential Chaos Shift Keying modulation. It is assu...
119
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
This paper proposes a method to construct an adaptive agent that is universal with respect to a given class of experts, where each expert is designed specifically for a particular...