Sciweavers

2747 search results - page 89 / 550
» Non-oblivious Strategy Improvement
Sort
View
ECAI
2004
Springer
15 years 10 months ago
Evaluation Strategies for Planning as Satisfiability
Abstract. We investigate different evaluation strategies for planning problems represented as constraint satisfaction or satisfiability problems. The standard evaluation strategy, ...
Jussi Rintanen
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 7 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
JEI
2008
307views more  JEI 2008»
15 years 6 months ago
Recall or precision-oriented strategies for binary classification of skin pixels
Skin detection is a preliminary step in many applications. We analyze some of the most frequently cited binary skin classifiers based on explicit color cluster definition and prese...
Francesca Gasparini, Silvia Corchs, Raimondo Schet...
IV
2010
IEEE
186views Visualization» more  IV 2010»
15 years 4 months ago
Visual Amortization Analysis of Recompilation Strategies
Abstract--Dynamic recompilation tries to produce more efficient code by exploiting runtime information. Virtual machines like the Jikes RVM use recompilation heuristics to decide h...
Stephan Zimmer, Stephan Diehl
CVIU
2008
106views more  CVIU 2008»
15 years 6 months ago
Strategies for shape matching using skeletons
Skeletons are often used as a framework for part-based shape description and matching. This paper describes some useful strategies that can be employed to improve the performance ...
Wooi-Boon Goh