Sciweavers

1347 search results - page 140 / 270
» On the Structure of the Minimum Time Function
Sort
View
ETS
2007
IEEE
128views Hardware» more  ETS 2007»
15 years 5 months ago
Selecting Power-Optimal SBST Routines for On-Line Processor Testing
Software-Based Self-Test (SBST) has emerged as an effective strategy for on-line testing of processors integrated in non-safety critical embedded system applications. Among the mo...
Andreas Merentitis, Nektarios Kranitis, Antonis M....
ECAI
2010
Springer
15 years 1 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
3DIM
2003
IEEE
15 years 9 months ago
Next View Planning for a Combination of Passive and Active Acquisition Techniques
In order to create a complete three-dimensional model of an object based on its two-dimensional images, the images have to be acquired from different views. An increasing number o...
Robert Sablatnig, Srdan Tosovic, Martin Kampel
IJRR
2007
171views more  IJRR 2007»
15 years 4 months ago
Creating High-quality Paths for Motion Planning
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
Roland Geraerts, Mark H. Overmars
DAM
2000
97views more  DAM 2000»
15 years 3 months ago
Algorithms and obstructions for linear-width and related search parameters
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
Dimitrios M. Thilikos