2543 search results - page 317 / 509 » Optimal Ordered Problem Solver |
141
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
137
click to vote
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
104
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
137
Voted
SIGMOD
2003
ACM
16 years 2 months ago
2003
ACM
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
125
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...