( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On forward checking for non-binary constraint satisfaction.

, , , и . Artif. Intell., 141 (1/2): 205-224 (2002)

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.

Javier Manero

Javier Jáurequi

Javier Dreyer

Javier Papa

Javier Arpón

 

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

Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems., и . Constraints An Int. J., 8 (3): 303-326 (2003)Using Constraints with Memory to Implement Variable Elimination., , и . ECAI, стр. 216-220. IOS Press, (2004)On the Practical use of Variable Elimination in Constraint Optimization Problems: 'Still-life' as a Case Study., , и . J. Artif. Intell. Res., (2005)Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems., и . SAT, том 12178 из Lecture Notes in Computer Science, стр. 218-232. Springer, (2020)On forward checking for non-binary constraint satisfaction., , , и . Artif. Intell., 141 (1/2): 205-224 (2002)New Inference Rules for Efficient Max-SAT Solving., и . AAAI, стр. 68-73. AAAI Press, (2006)Solving Max-SAT as Weighted CSP., , , и . CP, том 2833 из Lecture Notes in Computer Science, стр. 363-376. Springer, (2003)Solving 'Still Life' with Soft Constraints and Bucket Elimination., и . CP, том 2833 из Lecture Notes in Computer Science, стр. 466-479. Springer, (2003)Constraint Satisfaction as Global Optimization., и . IJCAI (1), стр. 579-585. Morgan Kaufmann, (1995)MiniMaxSat: A New Weighted Max-SAT Solver., , и . SAT, том 4501 из Lecture Notes in Computer Science, стр. 41-55. Springer, (2007)