Sciweavers

1529 search results - page 38 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
AIPS
2008
13 years 10 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein
ICPR
2002
IEEE
14 years 8 months ago
Radial Projections for Non-Linear Feature Extraction
In this work, two new techniques for non-linear feature extraction are presented. In these techniques, new features are obtained as radial projections of the original measurements...
Alberto J. Pérez Jiménez, Juan Carlo...
IPPS
2005
IEEE
14 years 1 months ago
Production Scheduling by Reachability Analysis - A Case Study
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Ange...
PRL
2010
209views more  PRL 2010»
13 years 2 months ago
Efficient update of the covariance matrix inverse in iterated linear discriminant analysis
For fast classification under real-time constraints, as required in many imagebased pattern recognition applications, linear discriminant functions are a good choice. Linear discr...
Jan Salmen, Marc Schlipsing, Christian Igel
SIBGRAPI
2005
IEEE
14 years 1 months ago
Linear Complexity Stereo Matching Based on Region Indexing
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
Marco Antonio Floriano de Oliveira, Raul Sidnei Wa...