Sciweavers

175 search results - page 9 / 35
» Lower Bounds for Dynamic Algebraic Problems
Sort
View
CORR
2011
Springer
239views Education» more  CORR 2011»
12 years 11 months ago
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
Imen Harbaoui Dridi, Ryan Kammarti, Pierre Borne, ...
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
14 years 10 days ago
On the myopic policy for a class of restless bandit problems with applications in dynamic multichannel access
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
Keqin Liu, Qing Zhao
JMLR
2012
11 years 10 months ago
Minimax rates for homology inference
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
Sivaraman Balakrishnan, Alessandro Rinaldo, Don Sh...
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite