Zobrazeno 1 - 3
of 3
pro vyhledávání: '"David Vulakh"'
Autor:
Raphael Finkel, David Vulakh
Publikováno v:
Soft Computing. 26:5765-5772
The Costas-array problem is a combinatorial constraint-satisfaction problem (CSP) that remains unsolved for many array sizes greater than 30. In order to reduce the time required to solve large instances, we present an Ant Colony Optimization algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::490fab9e08300598eab336dbaf817642
https://doi.org/10.1007/s00500-022-06969-1
https://doi.org/10.1007/s00500-022-06969-1
Autor:
Elchanan Mossel, David Vulakh
In an extant population, how much information do extant individuals provide on the pedigree of their ancestors? Recent work by Kim, Mossel, Ramnarayan and Turner (2020) studied this question under a number of simplifying assumptions, including random
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c66e201299a56ae8ae39bc4e4bfc547e
http://arxiv.org/abs/2204.04573
http://arxiv.org/abs/2204.04573
The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether deterministic alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8184bda8aecc97b8f5a03fabf7f64b77