3433 search results - page 394 / 687 » Heuristics for a bidding problem |
227
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
189
click to vote
IWANN
2009
Springer
16 years 1 months ago
2009
Springer
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
194
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
195
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We consider the problem of joint end-to-end rate optimization and radio resource management in wireless OFDMA-based mesh networks. Radio units equipped with multiple radio inte...
181
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...