10988 search results - page 339 / 2198 » Algorithmic Folding Complexity |
118
click to vote
IWINAC
2007
Springer
15 years 11 months ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
155
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
147
click to vote
KBSE
1997
IEEE
15 years 9 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
147
click to vote
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
154
click to vote
ALGORITHMICA
1999
15 years 4 months ago
1999
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...