Sciweavers

104 search results - page 18 / 21
» On the Complexity of Some Colorful Problems Parameterized by...
Sort
View
AAAI
2006
13 years 8 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
14 years 20 days ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
TSP
2010
13 years 2 months ago
A Doppler robust max-min approach to radar code design
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...
Antonio De Maio, Yongwei Huang, Marco Piezzo
AVSS
2006
IEEE
14 years 1 months ago
Nonparametric Background Modeling Using the CONDENSATION Algorithm
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
Xingzhi Luo, Suchendra M. Bhandarkar, Wei Hua, Hai...
IPL
2002
65views more  IPL 2002»
13 years 7 months ago
Parallel evolutionary algorithms can achieve super-linear performance
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
Enrique Alba