Sciweavers

95 search results - page 12 / 19
» On the Approximability of the Maximum Interval Constrained C...
Sort
View
SIAMJO
2008
175views more  SIAMJO 2008»
13 years 7 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
INFOCOM
2003
IEEE
14 years 23 days ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
EOR
2007
93views more  EOR 2007»
13 years 7 months ago
Exact algorithms for procurement problems under a total quantity discount structure
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
Dries R. Goossens, A. J. T. Maas, Frits C. R. Spie...
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 7 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
13 years 11 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...