Sciweavers

3838 search results - page 546 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
142
Voted
SMC
2010
IEEE
139views Control Systems» more  SMC 2010»
15 years 1 months ago
Pin-pointing concept descriptions
In this study, the task of obtaining accurate and comprehensible concept descriptions of a specific set of production instances has been investigated. The suggested method, inspire...
Cecilia Sönströd, Ulf Johansson, Henrik ...
140
Voted
MSWIM
2004
ACM
15 years 9 months ago
Scalable simulation of large-scale wireless networks with bounded inaccuracies
Discrete event network simulators have emerged as popular tools for verification and performance evaluation for various wireless networks. Nevertheless, the desire to model such ...
Zhengrong Ji, Junlan Zhou, Mineo Takai, Rajive Bag...
160
Voted
COMCOM
2008
151views more  COMCOM 2008»
15 years 3 months ago
Joint bandwidth allocation, element assignment and scheduling for wireless mesh networks with MIMO links
With the unique features of spatial multiplexing and interference suppression, Multiple Input Multiple Output (MIMO) techniques have great potential in the improvement of network ...
Jun Wang, Peng Du, Weijia Jia, Liusheng Huang, Hua...
EUROGP
2005
Springer
115views Optimization» more  EUROGP 2005»
15 years 9 months ago
Genetic Programming in Wireless Sensor Networks
Abstract. Wireless sensor networks (WSNs) are medium scale manifestations of a paintable or amorphous computing paradigm. WSNs are becoming increasingly important as they attain gr...
Derek M. Johnson, Ankur Teredesai, Robert T. Salta...
145
Voted
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 8 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...