Sciweavers

287 search results - page 52 / 58
» Constant Factor Approximations for the Hotlink Assignment Pr...
Sort
View
IJCAI
2007
13 years 10 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 2 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 8 months ago
Algorithmic Pricing via Virtual Valuations
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
Shuchi Chawla, Jason D. Hartline, Robert Kleinberg
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
14 years 3 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
FOCS
2009
IEEE
14 years 3 months ago
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna