2376 search results - page 270 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
137
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
152
Voted
ICIAR
2010
Springer
15 years 28 days ago
2010
Springer
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
130
Voted
CAP
2010
14 years 10 months ago
2010
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
117
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
138
Voted
IJCAI
2001
15 years 5 months ago
2001
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...