( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Generating highly balanced sudoku problems as hard problems.

, , , , и . J. Heuristics, 17 (5): 589-614 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Laura Ramón Giménez

Ramón Nolasco

Ramón Briegel

Ramón Kucharzak

Ramón Arzápalo

 

Другие публикации лиц с тем же именем

A Formal Model of Competence-Based Assessment., , , и . CCIA, том 202 из Frontiers in Artificial Intelligence and Applications, стр. 428-436. IOS Press, (2009)On the Characterization of the Maximal Ideal Recursive Semantics of RP-DeLP., , , и . CCIA, том 269 из Frontiers in Artificial Intelligence and Applications, стр. 215-224. IOS Press, (2014)Automated monitoring of medical protocols: a secure and distributed architecture., , , , и . Artif. Intell. Medicine, 27 (3): 367-392 (2003)A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions., , , и . Soft Comput., 23 (7): 2147-2166 (2019)The Impact of Balancing on Problem Hardness in a Highly Structured Domain., , , , и . AAAI, стр. 10-15. AAAI Press, (2006)On Balanced CSPs with High Treewidth., , , и . AAAI, стр. 161-166. AAAI Press, (2007)Generating Hard Instances for MaxSAT., , , и . ISMVL, стр. 191-195. IEEE Computer Society, (2009)A Modular Reduction of Regular Logic to Classical Logic., , и . ISMVL, стр. 221-226. IEEE Computer Society, (2001)Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks., , и . HICSS, стр. 297. IEEE Computer Society, (2002)On the hardness of solving edge matching puzzles as SAT or CSP problems., , , и . Constraints An Int. J., 18 (1): 7-37 (2013)