17760 search results - page 287 / 3552 » A Generalization of the Massey-Ding Algorithm |
168
click to vote
EUSFLAT
2007
15 years 8 months ago
2007
Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
160
click to vote
AAAI
2004
15 years 8 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
216
click to vote
ACST
2006
15 years 8 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
167
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
175
click to vote
AAAI
1994
15 years 8 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...