( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
GAIA at SM-KBP 2019 - A Multi-media Multi-lingual Knowledge Extraction and Hypothesis Generation System.

, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , и . TAC, NIST, (2019)

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.

Satish Kumar Bidani

Satish Kumar Jain

Satish Kumar Anand

Satish Kumar Anand

Satish Kumar Anand

 

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

A Tree-Based Algorithm for Construction Robots., , и . ICAPS, AAAI, (2014)Min-Max Message Passing and Local Consistency in Constraint Networks., , и . Australasian Conference on Artificial Intelligence, том 10400 из Lecture Notes in Computer Science, стр. 340-352. Springer, (2017)The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP., , и . CPAIOR, том 10335 из Lecture Notes in Computer Science, стр. 387-402. Springer, (2017)Fast (Incremental) Algorithms for Useful Classes of Simple Temporal Problems with Preferences.. IJCAI, стр. 1954-1959. (2007)Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers., , , , и . CoRR, (2019)Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery., , , , и . CoRR, (2018)Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios., , , , , , , , , и . CoRR, (2017)Multi-Agent Path Finding with Delay Probabilities., , и . CoRR, (2016)Lifting Techniques for Weighted Constraint Satisfaction Problems.. ISAIM, (2008)Multi-agent Path Finding with Capacity Constraints., , и . AI*IA, том 11946 из Lecture Notes in Computer Science, стр. 235-249. Springer, (2019)