628 search results - page 12 / 126 » The minimum shift design problem |
FOCS
2008
IEEE
14 years 1 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...
ISAAC
2010
Springer
13 years 5 months 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 ...
STOC
1999
ACM
13 years 11 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...
ICASSP
2008
IEEE
14 years 1 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...
CORR
2008
Springer
13 years 7 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...