Sciweavers

3656 search results - page 109 / 732
» Compact Location Problems
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 3 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
EOR
2008
82views more  EOR 2008»
15 years 24 days ago
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
Gustavo H. A. Martins, Robert F. Dell
102
Voted
DATE
2009
IEEE
95views Hardware» more  DATE 2009»
15 years 7 months ago
Machine learning-based volume diagnosis
In this paper, a novel diagnosis method is proposed. The proposed technique uses machine learning techniques instead of traditional cause-effect and/or effect-cause analysis. The ...
Seongmoon Wang, Wenlong Wei
107
Voted
LOCA
2005
Springer
15 years 6 months ago
Mobile Context Inference Using Low-Cost Sensors
In this paper, we introduce a compact system for fusing location data with data from simple, low-cost, non-location sensors to infer a user’s place and situational context. Speci...
Evan Welbourne, Jonathan Lester, Anthony LaMarca, ...
134
Voted
WINE
2005
Springer
139views Economy» more  WINE 2005»
15 years 6 months ago
Price of Anarchy, Locality Gap, and a Network Service Provider Game
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, V...