Sciweavers

1301 search results - page 211 / 261
» Bounded Version Vectors
Sort
View
ESA
2010
Springer
197views Algorithms» more  ESA 2010»
13 years 8 months ago
How to Allocate Goods in an Online Market?
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
Yossi Azar, Niv Buchbinder, Kamal Jain
WINE
2010
Springer
251views Economy» more  WINE 2010»
13 years 8 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
13 years 8 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
DPD
2010
153views more  DPD 2010»
13 years 7 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
AI
2011
Springer
13 years 5 months ago
The extended global cardinality constraint: An empirical survey
The Extended Global Cardinality Constraint (EGCC) is a vital component of constraint solving systems, since it is very widely used to model diverse problems. The literature contai...
Peter Nightingale