Sciweavers

975 search results - page 158 / 195
» Locality Optimization for Program Instances
Sort
View
GLOBECOM
2008
IEEE
13 years 9 months ago
Power Efficient Throughput Maximization in Multi-Hop Wireless Networks
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
ANOR
2008
90views more  ANOR 2008»
13 years 9 months ago
Multiple orders per job batch scheduling with incompatible jobs
: The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is ...
Vishnu Erramilli, Scott J. Mason
EOR
2010
102views more  EOR 2010»
13 years 9 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
TPDS
2008
72views more  TPDS 2008»
13 years 9 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert
MP
2010
145views more  MP 2010»
13 years 7 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...