Sciweavers

1259 search results - page 121 / 252
» In search of the memoryless property
Sort
View
PLILP
1993
Springer
15 years 5 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
CEC
2007
IEEE
15 years 5 months ago
A versatile quantum-inspired evolutionary algorithm
Abstract-- This study points out some weaknesses of existing Quantum-Inspired Evolutionary Algorithms (QEA) and explains in particular how hitchhiking phenomenons can slow down the...
Michael Defoin-Platel, Stefan Schliebs, Nikola Kas...
COMPGEOM
1987
ACM
15 years 5 months ago
Simplified Voronoi Diagrams
We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an r-dimensional space may be simplified to a search on an (r- l)-dimensional...
John F. Canny, Bruce Randall Donald
ECCV
2010
Springer
15 years 5 months ago
Optimal Contour Closure by Superpixel Grouping
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
15 years 5 months ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...