Sciweavers

3514 search results - page 39 / 703
» A search space
Sort
View
AAAI
1996
13 years 10 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
ICALP
2003
Springer
14 years 2 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
ACII
2005
Springer
13 years 11 months ago
Simulated Annealing Based Hand Tracking in a Discrete Space
Hand tracking is a challenging problem due to the complexity of searching in a 20+ degrees of freedom (DOF) space for an optimal estimation of hand configuration. This paper repres...
Wei Liang, Yunde Jia, Yang Liu, Cheng Ge
FLAIRS
2004
13 years 10 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
ICPR
2006
IEEE
14 years 10 months ago
Lexicon-based Browsers for Searching in News Video Archives
In this paper we present the methods and visualizations used in the MediaMill video search engine. The basis for the engine is a semantic indexing process which derives a lexicon ...
Cees Snoek, Dennis Koelma, Giang P. Nguyen, Marcel...