719 search results - page 110 / 144 » Adaptive Online Time Allocation to Search Algorithms |
109
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
SIGMOD
2011
ACM
14 years 17 days ago
2011
ACM
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
118
click to vote
SIGIR
2012
ACM
13 years 6 days ago
2012
ACM
We propose a mathematical framework for query selection as a mechanism for reducing the cost of constructing information retrieval test collections. In particular, our mathematica...
EVOW
2009
Springer
15 years 1 months ago
2009
Springer
In this paper the node-level decision unit of a self-learning anomaly detection mechanism for office monitoring with wireless sensor nodes is presented. The node-level decision uni...