3875 search results - page 594 / 775 » Approximation algorithms for the 0-extension problem |
174
click to vote
NIPS
1996
15 years 7 months ago
1996
Model learning combined with dynamic programming has been shown to be e ective for learning control of continuous state dynamic systems. The simplest method assumes the learned mod...
151
click to vote
DM
2006
15 years 6 months ago
2006
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
169
click to vote
JCSS
2008
15 years 6 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
183
click to vote
TON
2008
15 years 6 months ago
2008
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
187
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...