Sciweavers

3016 search results - page 103 / 604
» The Online Transportation Problem
Sort
View
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 6 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
COCOON
2006
Springer
15 years 7 months ago
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
E. C. Xavier, Flávio Keidi Miyazawa
105
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 3 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee
DS
2001
167views Database» more  DS 2001»
15 years 5 months ago
An Analysis of Integration Problems of XML-Based Catalogs for B2B Electronic Commerce
: Electronic B2B marketplaces bring together many online suppliers and buyers, each of which can potentially use his own format to represent the products in his product catalog. Th...
Borys Omelayenko, Dieter Fensel
114
Voted
AIPS
1994
15 years 5 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald