1013 search results - page 133 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
SWAT
1992
Springer
15 years 5 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
131
click to vote
NETWORKING
2000
15 years 2 months ago
2000
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— We consider the problem of minimizing the resources used for network coding while achieving the desired throughput in a multicast scenario. Since this problem is NPhard...
111
click to vote
ATMOS
2007
15 years 3 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
135
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...