callback( { "result":{ "query":":facetid:toc:\"db/conf/socs/socs2012.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"65.79" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"47", "@dc":"47", "@oc":"47", "@id":"43413709", "text":":facetid:toc:db/conf/socs/socs2012.bht" } }, "hits":{ "@total":"47", "@computed":"47", "@sent":"47", "@first":"0", "hit":[{ "@score":"1", "@id":"4494596", "info":{"authors":{"author":[{"@pid":"162/6938","text":"Ronald Alford"},{"@pid":"50/8393","text":"Vikas Shivashankar"},{"@pid":"69/5953","text":"Ugur Kuter"},{"@pid":"n/DanaSNau","text":"Dana S. Nau"}]},"title":"HTN Problem Spaces: Structure, Algorithms, Termination.","venue":"SOCS","pages":"2-9","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/AlfordSKN12","doi":"10.1609/SOCS.V3I1.18239","ee":"https://doi.org/10.1609/socs.v3i1.18239","url":"https://dblp.org/rec/conf/socs/AlfordSKN12"}, "url":"URL#4494596" }, { "@score":"1", "@id":"4494597", "info":{"authors":{"author":{"@pid":"60/1633-3","text":"Ken Anderson 0003"}},"title":"Tree Cache.","venue":"SOCS","pages":"203","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/Anderson12","doi":"10.1609/SOCS.V3I1.18257","ee":"https://doi.org/10.1609/socs.v3i1.18257","url":"https://dblp.org/rec/conf/socs/Anderson12"}, "url":"URL#4494597" }, { "@score":"1", "@id":"4494598", "info":{"authors":{"author":[{"@pid":"b/CBackstrom","text":"Christer Bäckström"},{"@pid":"j/PeterJonsson","text":"Peter Jonsson"}]},"title":"Abstracting Abstraction in Search II: Complexity Analysis.","venue":"SOCS","pages":"10-17","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/BackstromJ12","doi":"10.1609/SOCS.V3I1.18240","ee":"https://doi.org/10.1609/socs.v3i1.18240","url":"https://dblp.org/rec/conf/socs/BackstromJ12"}, "url":"URL#4494598" }, { "@score":"1", "@id":"4494599", "info":{"authors":{"author":[{"@pid":"117/4925","text":"Tomás Balyo"},{"@pid":"04/5344","text":"Roman Barták"},{"@pid":"13/1754","text":"Pavel Surynek"}]},"title":"On Improving Plan Quality via Local Enhancements.","venue":"SOCS","pages":"154-156","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/BalyoBS12","doi":"10.1609/SOCS.V3I1.18260","ee":"https://doi.org/10.1609/socs.v3i1.18260","url":"https://dblp.org/rec/conf/socs/BalyoBS12"}, "url":"URL#4494599" }, { "@score":"1", "@id":"4494600", "info":{"authors":{"author":{"@pid":"73/3430","text":"Adi Botea"}},"title":"Fast, Optimal Pathfinding with Compressed Path Databases.","venue":"SOCS","pages":"204-205","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/Botea12","doi":"10.1609/SOCS.V3I1.18251","ee":"https://doi.org/10.1609/socs.v3i1.18251","url":"https://dblp.org/rec/conf/socs/Botea12"}, "url":"URL#4494600" }, { "@score":"1", "@id":"4494601", "info":{"authors":{"author":[{"@pid":"66/2770","text":"Neil Burch"},{"@pid":"h/RobertHolte","text":"Robert C. Holte"}]},"title":"Automatic Move Pruning Revisited.","venue":"SOCS","pages":"18-24","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/BurchH12","doi":"10.1609/SOCS.V3I1.18232","ee":"https://doi.org/10.1609/socs.v3i1.18232","url":"https://dblp.org/rec/conf/socs/BurchH12"}, "url":"URL#4494601" }, { "@score":"1", "@id":"4494602", "info":{"authors":{"author":[{"@pid":"30/7442","text":"Ethan Andrew Burns"},{"@pid":"81/9923","text":"Matthew Hatem"},{"@pid":"92/9853","text":"Michael J. Leighton"},{"@pid":"80/5790","text":"Wheeler Ruml"}]},"title":"Implementing Fast Heuristic Search Code.","venue":"SOCS","pages":"25-32","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/BurnsHLR12","doi":"10.1609/SOCS.V3I1.18245","ee":"https://doi.org/10.1609/socs.v3i1.18245","url":"https://dblp.org/rec/conf/socs/BurnsHLR12"}, "url":"URL#4494602" }, { "@score":"1", "@id":"4494603", "info":{"authors":{"author":[{"@pid":"117/4962","text":"Jarad Cannon"},{"@pid":"09/4439","text":"Kevin Rose"},{"@pid":"80/5790","text":"Wheeler Ruml"}]},"title":"Real-Time Motion Planning with Dynamic Obstacles.","venue":"SOCS","pages":"33-40","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/CannonRR12","doi":"10.1609/SOCS.V3I1.18249","ee":"https://doi.org/10.1609/socs.v3i1.18249","url":"https://dblp.org/rec/conf/socs/CannonRR12"}, "url":"URL#4494603" }, { "@score":"1", "@id":"4494604", "info":{"authors":{"author":[{"@pid":"43/5063","text":"Ariel Felner"},{"@pid":"94/9797","text":"Meir Goldenberg"},{"@pid":"73/9853","text":"Guni Sharon"},{"@pid":"95/1348","text":"Roni Stern"},{"@pid":"117/4870","text":"Tal Beja"},{"@pid":"18/991","text":"Nathan R. Sturtevant"},{"@pid":"h/RobertHolte","text":"Robert Holte"},{"@pid":"s/JonathanSchaeffer","text":"Jonathan Schaeffer"}]},"title":"Partial-Expansion A* with Selective Node Generation.","venue":"SOCS","pages":"180-181","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/FelnerGSSBSHS12","doi":"10.1609/SOCS.V3I1.18227","ee":"https://doi.org/10.1609/socs.v3i1.18227","url":"https://dblp.org/rec/conf/socs/FelnerGSSBSHS12"}, "url":"URL#4494604" }, { "@score":"1", "@id":"4494605", "info":{"authors":{"author":[{"@pid":"f/ASFukunaga","text":"Alex Fukunaga"},{"@pid":"47/3148","text":"Akihiro Kishimoto"},{"@pid":"73/3430","text":"Adi Botea"}]},"title":"Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract).","venue":"SOCS","pages":"182-183","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/FukunagaKB12","doi":"10.1609/SOCS.V3I1.18226","ee":"https://doi.org/10.1609/socs.v3i1.18226","url":"https://dblp.org/rec/conf/socs/FukunagaKB12"}, "url":"URL#4494605" }, { "@score":"1", "@id":"4494606", "info":{"authors":{"author":[{"@pid":"03/4874","text":"Priyankar Ghosh"},{"@pid":"c/PPChakrabarti","text":"P. P. Chakrabarti 0001"},{"@pid":"39/2452","text":"Pallab Dasgupta"}]},"title":"Execution Ordering in AND/OR Graphs with Failure Probabilities.","venue":"SOCS","pages":"41-48","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/GhoshCD12","doi":"10.1609/SOCS.V3I1.18246","ee":"https://doi.org/10.1609/socs.v3i1.18246","url":"https://dblp.org/rec/conf/socs/GhoshCD12"}, "url":"URL#4494606" }, { "@score":"1", "@id":"4494607", "info":{"authors":{"author":[{"@pid":"94/9797","text":"Meir Goldenberg"},{"@pid":"43/5063","text":"Ariel Felner"},{"@pid":"95/1348","text":"Roni Stern"},{"@pid":"s/JonathanSchaeffer","text":"Jonathan Schaeffer"}]},"title":"A* Variants for Optimal Multi-Agent Pathfinding.","venue":"SOCS","pages":"157-158","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/GoldenbergFSS12","doi":"10.1609/SOCS.V3I1.18259","ee":"https://doi.org/10.1609/socs.v3i1.18259","url":"https://dblp.org/rec/conf/socs/GoldenbergFSS12"}, "url":"URL#4494607" }, { "@score":"1", "@id":"4494608", "info":{"authors":{"author":[{"@pid":"90/4127","text":"José E. Guivant"},{"@pid":"117/4906","text":"Brett Seton"},{"@pid":"139/6616","text":"Mark Albert Whitty"}]},"title":"2D Path Planning Based on Dijkstra's Algorithm and Pseudo Priority Queues.","venue":"SOCS","pages":"206","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/GuivantSW12","doi":"10.1609/SOCS.V3I1.18255","ee":"https://doi.org/10.1609/socs.v3i1.18255","url":"https://dblp.org/rec/conf/socs/GuivantSW12"}, "url":"URL#4494608" }, { "@score":"1", "@id":"4494609", "info":{"authors":{"author":[{"@pid":"83/8778","text":"Daniel Damir Harabor"},{"@pid":"04/3354","text":"Alban Grastien"}]},"title":"The JPS Pathfinding System.","venue":"SOCS","pages":"207-208","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/HaraborG12","doi":"10.1609/SOCS.V3I1.18254","ee":"https://doi.org/10.1609/socs.v3i1.18254","url":"https://dblp.org/rec/conf/socs/HaraborG12"}, "url":"URL#4494609" }, { "@score":"1", "@id":"4494610", "info":{"authors":{"author":[{"@pid":"14/1804-3","text":"Carlos Hernández 0003"},{"@pid":"85/5866","text":"Jorge A. Baier"},{"@pid":"93/8220","text":"Tansel Uras"},{"@pid":"k/SvenKoenig","text":"Sven Koenig"}]},"title":"Position Paper: Incremental Search Algorithms Considered Poorly Understood.","venue":"SOCS","pages":"159-161","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/HernandezBUK12","doi":"10.1609/SOCS.V3I1.18268","ee":"https://doi.org/10.1609/socs.v3i1.18268","url":"https://dblp.org/rec/conf/socs/HernandezBUK12"}, "url":"URL#4494610" }, { "@score":"1", "@id":"4494611", "info":{"authors":{"author":[{"@pid":"14/1804-3","text":"Carlos Hernández 0003"},{"@pid":"85/5866","text":"Jorge A. Baier"},{"@pid":"93/8220","text":"Tansel Uras"},{"@pid":"k/SvenKoenig","text":"Sven Koenig"}]},"title":"Paper Summary: Time-Bounded Adaptive A.","venue":"SOCS","pages":"184-185","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/HernandezBUK12a","doi":"10.1609/SOCS.V3I1.18228","ee":"https://doi.org/10.1609/socs.v3i1.18228","url":"https://dblp.org/rec/conf/socs/HernandezBUK12a"}, "url":"URL#4494611" }, { "@score":"1", "@id":"4494612", "info":{"authors":{"author":[{"@pid":"116/9265","text":"Scott Kiesel"},{"@pid":"30/7442","text":"Ethan Burns"},{"@pid":"80/5790","text":"Wheeler Ruml"}]},"title":"Abstraction-Guided Sampling for Motion Planning.","venue":"SOCS","pages":"162-163","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/KieselBR12","doi":"10.1609/SOCS.V3I1.18265","ee":"https://doi.org/10.1609/socs.v3i1.18265","url":"https://dblp.org/rec/conf/socs/KieselBR12"}, "url":"URL#4494612" }, { "@score":"1", "@id":"4494613", "info":{"authors":{"author":[{"@pid":"47/3148","text":"Akihiro Kishimoto"},{"@pid":"z/RongZhou1","text":"Rong Zhou 0001"},{"@pid":"07/9854","text":"Tatsuya Imai"}]},"title":"Diverse Depth-First Search in Satisificing Planning.","venue":"SOCS","pages":"164-165","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/KishimotoZI12","doi":"10.1609/SOCS.V3I1.18262","ee":"https://doi.org/10.1609/socs.v3i1.18262","url":"https://dblp.org/rec/conf/socs/KishimotoZI12"}, "url":"URL#4494613" }, { "@score":"1", "@id":"4494614", "info":{"authors":{"author":[{"@pid":"82/7788","text":"Levi H. S. Lelis"},{"@pid":"03/9798","text":"Shahab Jabbari Arfaee"},{"@pid":"z/SandraZilles","text":"Sandra Zilles"},{"@pid":"h/RobertHolte","text":"Robert C. Holte"}]},"title":"Learning Heuristic Functions Faster by Using Predicted Solution Costs.","venue":"SOCS","pages":"166-167","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/LelisAZH12","doi":"10.1609/SOCS.V3I1.18258","ee":"https://doi.org/10.1609/socs.v3i1.18258","url":"https://dblp.org/rec/conf/socs/LelisAZH12"}, "url":"URL#4494614" }, { "@score":"1", "@id":"4494615", "info":{"authors":{"author":[{"@pid":"82/7788","text":"Levi H. S. Lelis"},{"@pid":"95/1348","text":"Roni Stern"},{"@pid":"43/5063","text":"Ariel Felner"},{"@pid":"z/SandraZilles","text":"Sandra Zilles"},{"@pid":"h/RobertHolte","text":"Robert C. Holte"}]},"title":"Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract).","venue":"SOCS","pages":"186-187","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/LelisSFZH12","doi":"10.1609/SOCS.V3I1.18223","ee":"https://doi.org/10.1609/socs.v3i1.18223","url":"https://dblp.org/rec/conf/socs/LelisSFZH12"}, "url":"URL#4494615" }, { "@score":"1", "@id":"4494616", "info":{"authors":{"author":[{"@pid":"81/1376","text":"Marco Lippi 0001"},{"@pid":"74/1595","text":"Marco Ernandes"},{"@pid":"43/5063","text":"Ariel Felner"}]},"title":"Efficient Single Frontier Bidirectional Search.","venue":"SOCS","pages":"105-111","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/LippiEF12","doi":"10.1609/SOCS.V3I1.18248","ee":"https://doi.org/10.1609/socs.v3i1.18248","url":"https://dblp.org/rec/conf/socs/LippiEF12"}, "url":"URL#4494616" }, { "@score":"1", "@id":"4494617", "info":{"authors":{"author":[{"@pid":"56/5649","text":"Hootan Nakhost"},{"@pid":"m/MartinMuller3","text":"Martin Müller 0003"}]},"title":"A Theoretical Framework for Studying Random Walk Planning.","venue":"SOCS","pages":"57-64","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/NakhostM12","doi":"10.1609/SOCS.V3I1.18247","ee":"https://doi.org/10.1609/socs.v3i1.18247","url":"https://dblp.org/rec/conf/socs/NakhostM12"}, "url":"URL#4494617" }, { "@score":"1", "@id":"4494618", "info":{"authors":{"author":[{"@pid":"117/4878","text":"Sergio Núñez"},{"@pid":"05/2730","text":"Daniel Borrajo"},{"@pid":"21/6753","text":"Carlos Linares López"}]},"title":"Performance Analysis of Planning Portfolios.","venue":"SOCS","pages":"65-71","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/NunezBL12","doi":"10.1609/SOCS.V3I1.18238","ee":"https://doi.org/10.1609/socs.v3i1.18238","url":"https://dblp.org/rec/conf/socs/NunezBL12"}, "url":"URL#4494618" }, { "@score":"1", "@id":"4494619", "info":{"authors":{"author":[{"@pid":"16/6344","text":"Bo Pang"},{"@pid":"h/RobertHolte","text":"Robert C. Holte"}]},"title":"Multimapping Abstractions and Hierarchical Heuristic Search.","venue":"SOCS","pages":"72-79","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/PangH12","doi":"10.1609/SOCS.V3I1.18234","ee":"https://doi.org/10.1609/socs.v3i1.18234","url":"https://dblp.org/rec/conf/socs/PangH12"}, "url":"URL#4494619" }, { "@score":"1", "@id":"4494620", "info":{"authors":{"author":[{"@pid":"117/4943","text":"Ioannis P. Papikas"},{"@pid":"89/4430","text":"Ioannis Refanidis"}]},"title":"Fast Path Planning Through Segmentation of the Map into Manhattan-Cohesive Areas.","venue":"SOCS","pages":"209-210","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/PapikasR12","doi":"10.1609/SOCS.V3I1.18256","ee":"https://doi.org/10.1609/socs.v3i1.18256","url":"https://dblp.org/rec/conf/socs/PapikasR12"}, "url":"URL#4494620" }, { "@score":"1", "@id":"4494621", "info":{"authors":{"author":[{"@pid":"116/9258","text":"Chonhyon Park"},{"@pid":"97/896","text":"Jia Pan"},{"@pid":"m/DineshManocha","text":"Dinesh Manocha"}]},"title":"Real-Time Optimization-Based Planning in Dynamic Environments Using GPUs.","venue":"SOCS","pages":"168-170","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/ParkPM12","doi":"10.1609/SOCS.V3I1.18263","ee":"https://doi.org/10.1609/socs.v3i1.18263","url":"https://dblp.org/rec/conf/socs/ParkPM12"}, "url":"URL#4494621" }, { "@score":"1", "@id":"4494622", "info":{"authors":{"author":[{"@pid":"117/4957","text":"Álvaro Parra 0002"},{"@pid":"118/2636","text":"Álvaro Torralba Arias de Reyna"},{"@pid":"21/6753","text":"Carlos Linares López"}]},"title":"Precomputed-Direction Heuristics for Suboptimal Grid-Based Path-finding.","venue":"SOCS","pages":"211-212","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/ParraRL12","doi":"10.1609/SOCS.V3I1.18252","ee":"https://doi.org/10.1609/socs.v3i1.18252","url":"https://dblp.org/rec/conf/socs/ParraRL12"}, "url":"URL#4494622" }, { "@score":"1", "@id":"4494623", "info":{"authors":{"author":[{"@pid":"40/6084","text":"Mike Phillips"},{"@pid":"97/8366","text":"Benjamin J. Cohen"},{"@pid":"06/6547","text":"Sachin Chitta"},{"@pid":"33/1426","text":"Maxim Likhachev"}]},"title":"E-Graphs: Bootstrapping Planning with Experience Graphs.","venue":"SOCS","pages":"188-189","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/PhillipsCCL12","doi":"10.1609/SOCS.V3I1.18225","ee":"https://doi.org/10.1609/socs.v3i1.18225","url":"https://dblp.org/rec/conf/socs/PhillipsCCL12"}, "url":"URL#4494623" }, { "@score":"1", "@id":"4494624", "info":{"authors":{"author":{"@pid":"56/1461","text":"Erion Plaku"}},"title":"Motion Planning With Differential Constraints as Guided Search Over Continuous and Discrete Spaces.","venue":"SOCS","pages":"171-172","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/Plaku12","doi":"10.1609/SOCS.V3I1.18264","ee":"https://doi.org/10.1609/socs.v3i1.18264","url":"https://dblp.org/rec/conf/socs/Plaku12"}, "url":"URL#4494624" }, { "@score":"1", "@id":"4494625", "info":{"authors":{"author":[{"@pid":"43/8999","text":"Michael N. Rice"},{"@pid":"t/VassilisJTsotras","text":"Vassilis J. Tsotras"}]},"title":"Bidirectional A* Search with Additive Approximation Bounds.","venue":"SOCS","pages":"80-87","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/RiceT12","doi":"10.1609/SOCS.V3I1.18235","ee":"https://doi.org/10.1609/socs.v3i1.18235","url":"https://dblp.org/rec/conf/socs/RiceT12"}, "url":"URL#4494625" }, { "@score":"1", "@id":"4494626", "info":{"authors":{"author":[{"@pid":"92/2559","text":"Gabriele Röger"},{"@pid":"21/4581","text":"Malte Helmert"}]},"title":"Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984).","venue":"SOCS","pages":"173-174","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/RogerH12","doi":"10.1609/SOCS.V3I1.18267","ee":"https://doi.org/10.1609/socs.v3i1.18267","url":"https://dblp.org/rec/conf/socs/RogerH12"}, "url":"URL#4494626" }, { "@score":"1", "@id":"4494627", "info":{"authors":{"author":[{"@pid":"117/4897","text":"Qandeel Sajid"},{"@pid":"72/9853","text":"Ryan Luna"},{"@pid":"42/170","text":"Kostas E. Bekris"}]},"title":"Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives.","venue":"SOCS","pages":"88-96","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/SajidLB12","doi":"10.1609/SOCS.V3I1.18243","ee":"https://doi.org/10.1609/socs.v3i1.18243","url":"https://dblp.org/rec/conf/socs/SajidLB12"}, "url":"URL#4494627" }, { "@score":"1", "@id":"4494628", "info":{"authors":{"author":[{"@pid":"73/9853","text":"Guni Sharon"},{"@pid":"95/1348","text":"Roni Stern"},{"@pid":"43/5063","text":"Ariel Felner"},{"@pid":"18/991","text":"Nathan R. Sturtevant"}]},"title":"Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding.","venue":"SOCS","pages":"97-104","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/SharonSFS12","doi":"10.1609/SOCS.V3I1.18244","ee":"https://doi.org/10.1609/socs.v3i1.18244","url":"https://dblp.org/rec/conf/socs/SharonSFS12"}, "url":"URL#4494628" }, { "@score":"1", "@id":"4494629", "info":{"authors":{"author":[{"@pid":"73/9853","text":"Guni Sharon"},{"@pid":"95/1348","text":"Roni Stern"},{"@pid":"43/5063","text":"Ariel Felner"},{"@pid":"18/991","text":"Nathan R. Sturtevant"}]},"title":"Conflict-Based Search for Optimal Multi-Agent Path Finding.","venue":"SOCS","pages":"190","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/SharonSFS12a","doi":"10.1609/SOCS.V3I1.18222","ee":"https://doi.org/10.1609/socs.v3i1.18222","url":"https://dblp.org/rec/conf/socs/SharonSFS12a"}, "url":"URL#4494629" }, { "@score":"1", "@id":"4494630", "info":{"authors":{"author":[{"@pid":"117/4987","text":"Silvan Sievers"},{"@pid":"01/8221","text":"Manuela Ortlieb"},{"@pid":"21/4581","text":"Malte Helmert"}]},"title":"Efficient Implementation of Pattern Database Heuristics for Classical Planning.","venue":"SOCS","pages":"49-56","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/SieversOH12","doi":"10.1609/SOCS.V3I1.18237","ee":"https://doi.org/10.1609/socs.v3i1.18237","url":"https://dblp.org/rec/conf/socs/SieversOH12"}, "url":"URL#4494630" }, { "@score":"1", "@id":"4494631", "info":{"authors":{"author":[{"@pid":"95/1348","text":"Roni Tzvi Stern"},{"@pid":"43/5063","text":"Ariel Felner"},{"@pid":"h/RobertHolte","text":"Robert C. Holte"}]},"title":"Search-Aware Conditions for Probably Approximately Correct Heuristic Search.","venue":"SOCS","pages":"112-119","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/SternFH12","doi":"10.1609/SOCS.V3I1.18236","ee":"https://doi.org/10.1609/socs.v3i1.18236","url":"https://dblp.org/rec/conf/socs/SternFH12"}, "url":"URL#4494631" }, { "@score":"1", "@id":"4494632", "info":{"authors":{"author":{"@pid":"13/1754","text":"Pavel Surynek"}},"title":"A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints.","venue":"SOCS","pages":"191-192","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/Surynek12","doi":"10.1609/SOCS.V3I1.18220","ee":"https://doi.org/10.1609/socs.v3i1.18220","url":"https://dblp.org/rec/conf/socs/Surynek12"}, "url":"URL#4494632" }, { "@score":"1", "@id":"4494633", "info":{"authors":{"author":[{"@pid":"12/4034","text":"Jordan Tyler Thayer"},{"@pid":"63/2238-1","text":"J. Benton 0001"},{"@pid":"21/4581","text":"Malte Helmert"}]},"title":"Better Parameter-Free Anytime Search by Minimizing Time Between Solutions.","venue":"SOCS","pages":"120-128","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/ThayerBH12","doi":"10.1609/SOCS.V3I1.18242","ee":"https://doi.org/10.1609/socs.v3i1.18242","url":"https://dblp.org/rec/conf/socs/ThayerBH12"}, "url":"URL#4494633" }, { "@score":"1", "@id":"4494634", "info":{"authors":{"author":[{"@pid":"12/4034","text":"Jordan Tyler Thayer"},{"@pid":"95/1348","text":"Roni Stern"},{"@pid":"82/7788","text":"Levi H. S. Lelis"}]},"title":"Are We There Yet? - Estimating Search Progress.","venue":"SOCS","pages":"129-136","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/ThayerSL12","doi":"10.1609/SOCS.V3I1.18241","ee":"https://doi.org/10.1609/socs.v3i1.18241","url":"https://dblp.org/rec/conf/socs/ThayerSL12"}, "url":"URL#4494634" }, { "@score":"1", "@id":"4494635", "info":{"authors":{"author":[{"@pid":"25/7117","text":"David Tolpin"},{"@pid":"08/1674","text":"Solomon Eyal Shimony"}]},"title":"MCTS Based on Simple Rerget.","venue":"SOCS","pages":"193-199","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/TolpinS12","doi":"10.1609/SOCS.V3I1.18221","ee":"https://doi.org/10.1609/socs.v3i1.18221","url":"https://dblp.org/rec/conf/socs/TolpinS12"}, "url":"URL#4494635" }, { "@score":"1", "@id":"4494636", "info":{"authors":{"author":[{"@pid":"93/8220","text":"Tansel Uras"},{"@pid":"k/SvenKoenig","text":"Sven Koenig"},{"@pid":"14/1804-3","text":"Carlos Hernández 0003"}]},"title":"Subgoal Graphs for Eight-Neighbor Gridworlds.","venue":"SOCS","pages":"213-214","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/UrasKH12","doi":"10.1609/SOCS.V3I1.18253","ee":"https://doi.org/10.1609/socs.v3i1.18253","url":"https://dblp.org/rec/conf/socs/UrasKH12"}, "url":"URL#4494636" }, { "@score":"1", "@id":"4494637", "info":{"authors":{"author":[{"@pid":"00/8221","text":"Richard Anthony Valenzano"},{"@pid":"03/9798","text":"Shahab Jabbari Arfaee"},{"@pid":"12/4034","text":"Jordan Tyler Thayer"},{"@pid":"95/1348","text":"Roni Stern"}]},"title":"Alternative Forms of Bounded Suboptimal Search.","venue":"SOCS","pages":"175-176","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/ValenzanoATS12","doi":"10.1609/SOCS.V3I1.18266","ee":"https://doi.org/10.1609/socs.v3i1.18266","url":"https://dblp.org/rec/conf/socs/ValenzanoATS12"}, "url":"URL#4494637" }, { "@score":"1", "@id":"4494638", "info":{"authors":{"author":[{"@pid":"07/1924","text":"Paul Vernaza"},{"@pid":"117/4895","text":"Venkatraman Narayanan"},{"@pid":"33/1426","text":"Maxim Likhachev"}]},"title":"Efficiently Finding Optimal Winding-Constrained Loops in the Plane: Extended Abstract.","venue":"SOCS","pages":"201-202","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/VernazaNL12","doi":"10.1609/SOCS.V3I1.18224","ee":"https://doi.org/10.1609/socs.v3i1.18224","url":"https://dblp.org/rec/conf/socs/VernazaNL12"}, "url":"URL#4494638" }, { "@score":"1", "@id":"4494639", "info":{"authors":{"author":[{"@pid":"40/10332","text":"Glenn Wagner"},{"@pid":"c/HowieChoset","text":"Howie Choset"},{"@pid":"57/4428","text":"Nora Ayanian"}]},"title":"Subdimensional Expansion and Optimal Task Reassignment.","venue":"SOCS","pages":"177-178","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/WagnerCA12","doi":"10.1609/SOCS.V3I1.18261","ee":"https://doi.org/10.1609/socs.v3i1.18261","url":"https://dblp.org/rec/conf/socs/WagnerCA12"}, "url":"URL#4494639" }, { "@score":"1", "@id":"4494640", "info":{"authors":{"author":[{"@pid":"69/9798","text":"Christopher Makoto Wilt"},{"@pid":"80/5790","text":"Wheeler Ruml"}]},"title":"When Does Weighted A* Fail?","venue":"SOCS","pages":"137-144","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/WiltR12","doi":"10.1609/SOCS.V3I1.18250","ee":"https://doi.org/10.1609/socs.v3i1.18250","url":"https://dblp.org/rec/conf/socs/WiltR12"}, "url":"URL#4494640" }, { "@score":"1", "@id":"4494641", "info":{"authors":{"author":[{"@pid":"57/11043","text":"Xi Yun"},{"@pid":"79/4353","text":"Susan L. Epstein"}]},"title":"Adaptive Parallelization for Constraint Satisfaction Search.","venue":"SOCS","pages":"145-152","year":"2012","type":"Conference and Workshop Papers","access":"open","key":"conf/socs/YunE12","doi":"10.1609/SOCS.V3I1.18233","ee":"https://doi.org/10.1609/socs.v3i1.18233","url":"https://dblp.org/rec/conf/socs/YunE12"}, "url":"URL#4494641" }, { "@score":"1", "@id":"4514907", "info":{"authors":{"author":[{"@pid":"05/2730","text":"Daniel Borrajo"},{"@pid":"43/5063","text":"Ariel Felner"},{"@pid":"18/2128","text":"Richard E. Korf"},{"@pid":"33/1426","text":"Maxim Likhachev"},{"@pid":"21/6753","text":"Carlos Linares López"},{"@pid":"80/5790","text":"Wheeler Ruml"},{"@pid":"18/991","text":"Nathan R. Sturtevant"}]},"title":"Proceedings of the Fifth Annual Symposium on Combinatorial Search, SOCS 2012, Niagara Falls, Ontario, Canada, July 19-21, 2012","venue":"SOCS","publisher":"AAAI Press","year":"2012","type":"Editorship","access":"open","key":"conf/socs/2012","ee":"https://ojs.aaai.org/index.php/SOCS/issue/view/432","url":"https://dblp.org/rec/conf/socs/2012"}, "url":"URL#4514907" } ] } } } )