Sciweavers

6833 search results - page 1155 / 1367
» Some two-character sets
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
SIGMOD
2010
ACM
231views Database» more  SIGMOD 2010»
15 years 11 months ago
Automatically incorporating new sources in keyword search-based data integration
Scientific data offers some of the most interesting challenges in data integration today. Scientific fields evolve rapidly and accumulate masses of observational and experiment...
Partha Pratim Talukdar, Zachary G. Ives, Fernando ...
SIGMOD
2009
ACM
165views Database» more  SIGMOD 2009»
15 years 11 months ago
Query by output
It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema, the hidden relationships among attributes in t...
Quoc Trung Tran, Chee-Yong Chan, Srinivasan Partha...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 11 months ago
Branch, Cut, and Price: Sequential and Parallel
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...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
« Prev « First page 1155 / 1367 Last » Next »