Sciweavers

414 search results - page 42 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
EOR
2010
219views more  EOR 2010»
13 years 8 months ago
The Attractive Traveling Salesman Problem
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Günes Erdogan, Jean-François Cordeau, ...
ICC
2009
IEEE
121views Communications» more  ICC 2009»
13 years 6 months ago
Designing Demand-Wise Shared Protection Networks with Specified Minimum Dual-Failure Restorability
-- We develop a new integer linear programming model to optimally design demand-wise shared protection (DSP) networks to achieve specified minimum levels of dual-failure restorabil...
Jude Akpuh, John Doucette
LCN
2008
IEEE
14 years 3 months ago
Delay constrained placement of mobile data collectors in underwater acoustic sensor networks
—We propose a scheme for routing and placement of mobile data collectors in Underwater Acoustic Sensor Networks (UASNs). The proposed scheme maximizes the lifetime of the network...
Waleed Alsalih, Hossam S. Hassanein, Selim G. Akl
MOBIHOC
2004
ACM
14 years 2 months ago
Antenna orientation optimization for minimum-energy multicast tree construction in wireless ad hoc networks with directional ant
Energy conservation is a critical issue in wireless ad hoc networks since batteries are the only energy source to power the nodes. One major metric for energy conservation is to r...
Song Guo, Oliver W. W. Yang
EMNLP
2007
13 years 10 months ago
Modelling Compression with Discourse Constraints
Sentence compression holds promise for many applications ranging from summarisation to subtitle generation and subtitle generation. The task is typically performed on isolated sen...
James Clarke, Mirella Lapata