( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Handbook of Satisfiability

, , , и (Ред.) том 185 из Frontiers in Artificial Intelligence and Applications, IOS Press, (2009)

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.

Mark Walsh

Gordon Toby

Samuel Toby

Toby Bloom

Gianfranco Walsh

 

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

Compact Preference Representation in Stable Marriage Problems., , , и . ADT, том 5783 из Lecture Notes in Computer Science, стр. 390-401. Springer, (2009)Among, Common and Disjoint Constraints., , , , и . CSCLP, том 3978 из Lecture Notes in Computer Science, стр. 29-43. Springer, (2005)Fair Pairwise Exchange among Groups., , и . IJCAI, стр. 419-425. ijcai.org, (2021)Possible and necessary winners in voting trees: majority graphs vs. profiles., , , и . AAMAS, стр. 311-318. IFAAMAS, (2011)Possible and Necessary Allocations via Sequential Mechanisms., , и . IJCAI, стр. 468-474. AAAI Press, (2015)Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging., , , , , , и . IJCAI, стр. 5569-5575. ijcai.org, (2019)The Range Constraint: Algorithms and Implementation., , , , и . CPAIOR, том 3990 из Lecture Notes in Computer Science, стр. 59-73. Springer, (2006)Online Cake Cutting.. ADT, том 6992 из Lecture Notes in Computer Science, стр. 292-305. Springer, (2011)Depth-bounded Discrepancy Search.. IJCAI, стр. 1388-1395. Morgan Kaufmann, (1997)Abstract Theorem Proving., и . IJCAI, стр. 372-377. Morgan Kaufmann, (1989)