Sciweavers

1983 search results - page 275 / 397
» Competitive graph searches
Sort
View
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 10 months ago
Improving Transaction-Time DBMS Performance and Functionality
Immortal DB is a transaction time database system that is built into a commercial database system rather than being layered on top. This enables it to have performance that is very...
David B. Lomet, Feifei Li
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
14 years 9 months ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
ICML
1995
IEEE
14 years 9 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
WWW
2008
ACM
14 years 9 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...
KDD
2001
ACM
211views Data Mining» more  KDD 2001»
14 years 8 months ago
Magical thinking in data mining: lessons from CoIL challenge 2000
CoIL challenge 2000 was a supervised learning contest that attracted 43 entries. The authors of 29 entries later wrote explanations of their work. This paper discusses these repor...
Charles Elkan