584 search results - page 13 / 117 » Combinatorial optimization problems in wireless switch desig... |
CEC
2010
IEEE
13 years 5 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
TMC
2012
11 years 10 months ago
2012
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
IWINAC
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
GECCO
2003
Springer
14 years 26 days ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
ORL
2006
13 years 7 months ago
2006
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...