-
1
-
-
0032313045
-
-
Haas, Z.J., Tabrizi, S.: On some challenges and design choices in ad-hoc communications. In: IEEE MILCOM 1998, Bedford, USA, pp. 187-192 (1998)
-
Haas, Z.J., Tabrizi, S.: On some challenges and design choices in ad-hoc communications. In: IEEE MILCOM 1998, Bedford, USA, pp. 187-192 (1998)
-
-
-
-
3
-
-
0033894011
-
On the construction of energy-efficient broadcast and multicast trees in wireless networks
-
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proceedings of the 19th IEEE INFOCOM 2000., pp. 585-594 (2000)
-
(2000)
Proceedings of the 19th IEEE INFOCOM
, pp. 585-594
-
-
Wieselthier, J.E.1
Nguyen, G.D.2
Ephremides, A.3
-
4
-
-
0034179713
-
Nested partitions method for global optimization
-
Shi, L., Ólafsson, S.: Nested partitions method for global optimization. Operations Research 48(3), 390-407 (2000)
-
(2000)
Operations Research
, vol.48
, Issue.3
, pp. 390-407
-
-
Shi, L.1
Ólafsson, S.2
-
6
-
-
0035707473
-
An optimization framework for product design
-
Shi, L., Ólafsson, S., Chen, Q.: An optimization framework for product design. Management Science 47(12), 1681-1692 (2001)
-
(2001)
Management Science
, vol.47
, Issue.12
, pp. 1681-1692
-
-
Shi, L.1
Ólafsson, S.2
Chen, Q.3
-
7
-
-
0034135525
-
A method for scheduling in parallel manufacturing systems with flexible resources
-
Ólafsson, S., Shi, L.: A method for scheduling in parallel manufacturing systems with flexible resources. HE Transactions 32(2), 135-146 (2000)
-
(2000)
HE Transactions
, vol.32
, Issue.2
, pp. 135-146
-
-
Ólafsson, S.1
Shi, L.2
-
8
-
-
84957104213
-
On the complexity of computing minimum energy consumption broadcast subgraphs
-
Ferreira, A, Reichel,H.eds, STACS 2001, Springer, Heidelberg
-
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocea, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel,H.(eds.) STACS 2001. LNCS, vol. 2010, pp. 121-131. Springer, Heidelberg (2001)
-
(2001)
LNCS
, vol.2010
, pp. 121-131
-
-
Clementi, A.E.F.1
Crescenzi, P.2
Penna, P.3
Rossi, G.4
Vocea, P.5
-
9
-
-
0036948878
-
Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues
-
ACM Press, New York
-
Cagalj, M., Hubaux, J.P., Enz, C.: Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues. In: MobiCom 2002: Proceedings of the 8th Annual International Conference on Mobile Computing and Networking, pp. 172-182. ACM Press, New York (2002)
-
(2002)
MobiCom 2002: Proceedings of the 8th Annual International Conference on Mobile Computing and Networking
, pp. 172-182
-
-
Cagalj, M.1
Hubaux, J.P.2
Enz, C.3
-
10
-
-
26444440419
-
-
Ambühl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C, Yung, M. (eds.) ICALP 2005. LNCS, 3580, pp. 1139-1150. Springer, Heidelberg (2005)
-
Ambühl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C, Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1139-1150. Springer, Heidelberg (2005)
-
-
-
-
11
-
-
0036847411
-
Minimum-energy broadcasting in static ad hoc wireless networks
-
Wan, P.J., Cǎlinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks 8(6), 607-617 (2002)
-
(2002)
Wireless Networks
, vol.8
, Issue.6
, pp. 607-617
-
-
Wan, P.J.1
Cǎlinescu, G.2
Li, X.Y.3
Frieder, O.4
-
12
-
-
0842267707
-
A.: R-shrink: A heuristic for improving minimum power broadcast trees in wireless networks
-
IEEE, Los Alamitos
-
Das, A.K., Marks, R.J., El-Sharkawi, M., Arabshahi, P., Gray, A.: r-shrink: A heuristic for improving minimum power broadcast trees in wireless networks. In: Global Telecommunications Conference, GLOBECOM 2003, pp. 523-527. IEEE, Los Alamitos (2003)
-
(2003)
Global Telecommunications Conference, GLOBECOM
, pp. 523-527
-
-
Das, A.K.1
Marks, R.J.2
Sharkawi, E.3
Arabshahi, M.4
Gray, P.5
-
13
-
-
33744467378
-
Iterated local optimization for minimum energy broadcast
-
WiOpt, pp, IEEE Computer Society, Los Alamitos
-
Kang, I., Poovendran, R.: Iterated local optimization for minimum energy broadcast. In: 3rd International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt), pp. 332-341. IEEE Computer Society, Los Alamitos (2005)
-
(2005)
3rd International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks
, pp. 332-341
-
-
Kang, I.1
Poovendran, R.2
-
14
-
-
18144386539
-
Broadcast with heterogeneous node capability
-
IEEE, Los Alamitos
-
Kang, I., Poovendran, R.: Broadcast with heterogeneous node capability. In: Global Telecommunications Conference, GLOBECOM 2004, pp. 4114-4119. IEEE, Los Alamitos (2004)
-
(2004)
Global Telecommunications Conference, GLOBECOM
, pp. 4114-4119
-
-
Kang, I.1
Poovendran, R.2
-
15
-
-
0042941430
-
Minimum power broadcast trees for wireless networks: Integer programming formulations
-
Das, A.K., Marks, R.J., El-Sharkawi, M., Arabshahi, P., Gray, A.: Minimum power broadcast trees for wireless networks: Integer programming formulations. In: Proceedings of the 22nd IEEE INFOCOM 2003, pp. 1001-1010 (2003)
-
(2003)
Proceedings of the 22nd IEEE INFOCOM
, pp. 1001-1010
-
-
Das, A.K.1
Marks, R.J.2
El-Sharkawi, M.3
Arabshahi, P.4
Gray, A.5
-
16
-
-
24944489640
-
The minimum power broadcast problem in wireless networks: A simulated annealing approach
-
Montemanni, R., Gambardella, L.M., Das, A.: The minimum power broadcast problem in wireless networks: a simulated annealing approach. Wireless Communications and Networking Conference (WCNC) 4, 2057-2062 (2005)
-
(2005)
Wireless Communications and Networking Conference (WCNC)
, vol.4
, pp. 2057-2062
-
-
Montemanni, R.1
Gambardella, L.M.2
Das, A.3
-
17
-
-
0032782385
-
New parallel randomized algorithms for the traveling salesman problem
-
Shi, L., Ólafsson, S., Sun, N.: New parallel randomized algorithms for the traveling salesman problem. Computers and Operations Research 26(4), 371-394 (1999)
-
(1999)
Computers and Operations Research
, vol.26
, Issue.4
, pp. 371-394
-
-
Shi, L.1
Ólafsson, S.2
Sun, N.3
-
18
-
-
54949119154
-
Ants for sampling in the nested partition algorithm
-
Al-Shihabi, S.: Ants for sampling in the nested partition algorithm. In: Hybrid Metaheuristics, pp. 11-18 (2004)
-
(2004)
Hybrid Metaheuristics
, pp. 11-18
-
-
Al-Shihabi, S.1
|