7303 search results - page 1376 / 1461 » Optimality for dynamic patterns |
106
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
124
click to vote
CCO
2001
Springer
15 years 6 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
111
click to vote
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
127
click to vote
SIGMOD
2000
ACM
15 years 6 months ago
2000
ACM
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an ac...
123
click to vote
CGO
2010
IEEE
15 years 6 months ago
2010
IEEE
To improve the performance of transactional memory (TM), researchers have found many eager and lazy optimizations for conflict detection, the process of determining if transaction...