Sciweavers

1277 search results - page 200 / 256
» Terminating Decision Algorithms Optimally
Sort
View
124
Voted
PLDI
1995
ACM
15 years 7 months ago
Storage Assignment to Decrease Code Size
DSP architectures typically provide indirect addressing modes with auto-increment and decrement. In addition, indexing mode is not available, and there are usually few, if any, ge...
Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Stev...
137
Voted
ENDM
2006
77views more  ENDM 2006»
15 years 3 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
125
Voted
SAC
2008
ACM
15 years 3 months ago
Decentralized coordination strategies for the vehicle routing problem
Modern software control systems must cope with uncertainty, manage dynamic environments, as well as provide greater flexibility. Distributed agent-based control systems are the id...
Matteo Vasirani, Sascha Ossowski
127
Voted
ICPR
2008
IEEE
16 years 4 months ago
Training sequential on-line boosting classifier for visual tracking
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
Helmut Grabner, Horst Bischof, Jan Sochman, Jiri M...
121
Voted
ICML
2007
IEEE
16 years 4 months ago
On one method of non-diagonal regularization in sparse Bayesian learning
In the paper we propose a new type of regularization procedure for training sparse Bayesian methods for classification. Transforming Hessian matrix of log-likelihood function to d...
Dmitry Kropotov, Dmitry Vetrov