Sciweavers

2034 search results - page 79 / 407
» Substring Selectivity Estimation
Sort
View
CG
2006
Springer
15 years 1 months ago
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
Rémi Coulom
DAGM
2006
Springer
15 years 1 months ago
Parameterless Isomap with Adaptive Neighborhood Selection
Abstract. Isomap is a highly popular manifold learning and dimensionality reduction technique that effectively performs multidimensional scaling on estimates of geodesic distances....
Nathan Mekuz, John K. Tsotsos
COR
2008
88views more  COR 2008»
14 years 10 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
PAMI
2007
102views more  PAMI 2007»
14 years 9 months ago
Feature Subset Selection and Ranking for Data Dimensionality Reduction
—A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one ...
Hua-Liang Wei, Stephen A. Billings
ICAI
2009
14 years 7 months ago
The Utility of Affect in the Selection of Actions and Goals Under Real-World Constraints
We present a novel affective goal selection mechanism for decision-making in agents with limited computational resources (e.g., such as robots operating under real-time constraint...
Paul W. Schermerhorn, Matthias Scheutz