2027 search results - page 254 / 406 » When is it best to best-respond |
117
click to vote
ACL
2006
15 years 2 months ago
2006
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
136
click to vote
AIPS
2006
15 years 2 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
135
click to vote
CNIS
2006
15 years 2 months ago
2006
Multidimensional Packet Classification is one of the most critical functions for network security devices such as firewalls and intrusion detection systems. Due to the worst case ...
117
click to vote
DAGSTUHL
2004
15 years 2 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
103
Voted
DLT
2006
15 years 2 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...