Sciweavers

1168 search results - page 84 / 234
» Optimization strategies for complex queries
Sort
View
IOR
2011
96views more  IOR 2011»
14 years 4 months ago
On the Minimax Complexity of Pricing in a Changing Environment
We consider a pricing problem in an environment where the customers’ willingness-to-pay (WtP) distribution may change at some point over the selling horizon. Customers arrive se...
Omar Besbes, Assaf J. Zeevi
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
15 years 10 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
SIGMOD
2012
ACM
222views Database» more  SIGMOD 2012»
13 years 10 days ago
Tiresias: a demonstration of how-to queries
In this demo, we will present Tiresias, the first how-to query engine. How-to queries represent fundamental data analysis questions of the form: “How should the input change in...
Alexandra Meliou, Yisong Song, Dan Suciu
ICUMT
2009
14 years 7 months ago
A COP for cooperation in a P2P streaming protocol
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
María Elisa Bertinat, Darío Padula, ...
ISSTA
2004
ACM
15 years 3 months ago
Covering arrays for efficient fault characterization in complex configuration spaces
—Many modern software systems are designed to be highly configurable so they can run on and be optimized for a wide variety of platforms and usage scenarios. Testing such systems...
Cemal Yilmaz, Myra B. Cohen, Adam A. Porter