• GitHub

  • Referenced in 663 articles [sw23170]
  • wikis for every project.[4] GitHub offers plans for both private repositories and free accounts...
  • Graphplan

  • Referenced in 176 articles [sw07746]
  • Fast planning through planning graph analysis. We introduce a new approach to planning in STRIPS ... analyzing a compact structure we call a planning graph. We describe a new planner, Graphplan ... always returns a shortest possible partial-order plan, or states that no valid plan exists.par ... variety of interesting natural and artificial planning problems. We also give empirical evidence that...
  • CGAL

  • Referenced in 293 articles [sw00118]
  • molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More...
  • Mosek

  • Referenced in 261 articles [sw04618]
  • hospital management, Power supply and network planning, Logistics, TV commercial scheduling, Structural engineering...
  • DYNAMO

  • Referenced in 199 articles [sw01227]
  • resource studies[1][2] and urban planning.[3][4] DYNAMO was initially developed under...
  • PDDL

  • Referenced in 82 articles [sw07079]
  • Planning Domain Definition Language (PDDL). PDDL2.1: An extension to PDDL for expressing temporal planning domains ... recent years research in the planning community has moved increasingly toward s application of planners ... resources. For example, interest in planning demonstrated by the space res earch community has inspired ... temporal and resource-intensive domains including logistics planning, plant control and manufacturing have also helped...
  • Graphs

  • Referenced in 101 articles [sw12277]
  • different names): algorithm engineers construct fast route planning methods; database and information systems researchers investigate...
  • AETG

  • Referenced in 52 articles [sw09715]
  • generated both high-level test plans and detailed test cases. In several applications, it greatly ... reduced the cost of test plan development...
  • NetLogo

  • Referenced in 72 articles [sw09150]
  • behind our design and describe recent and planned enhancements...
  • CCalc

  • Referenced in 72 articles [sw09899]
  • programming. Computationally, CCalc uses ideas of satisfiability planning. (A related system, Cplus2ASP from Arizona State...
  • STAN

  • Referenced in 38 articles [sw03348]
  • domain-independent planner developed within the Strathclyde Planning Group. It has been developed through ... Graphplan, competed in the first international planning competition at AIPS’98 and demonstrated interesting performance ... powerful representational structure for the core plan-graph and using a wave-front mechanism ... search and graph construction costs once the plan-graph structure reaches a stable state. STAN...
  • GenStat

  • Referenced in 63 articles [sw10667]
  • less experienced users through the well planned menu and diagnostic messaging (not to mention...
  • SOM

  • Referenced in 59 articles [sw07375]
  • flexible as the MATLAB environment. So the plan was to offer a simple, well documented...
  • Jason

  • Referenced in 55 articles [sw06187]
  • suitable for the implementation of reactive planning systems according to the Belief-Desire-Intention...
  • SPARK

  • Referenced in 48 articles [sw03124]
  • time errors, both as guidance in planning the effort required, and for practical advice...
  • ConGolog

  • Referenced in 47 articles [sw01801]
  • situation calculus As an alternative to planning, an approach to high-level agent control based...
  • Cohn-Kanade

  • Referenced in 46 articles [sw04974]
  • Lucey et al. (2010). Version 3 is planned for spring 2013. The original data collection...
  • OpenSSL

  • Referenced in 45 articles [sw09945]
  • volunteers that use the Internet to communicate, plan, and develop the OpenSSL toolkit...
  • Lambda-Clam

  • Referenced in 24 articles [sw19614]
  • LambdaClam ( λclam, lclam) is a proof planning system that support proof planning over higher-order ... domains: System description: Proof planning in higher-order logic with λClam. This system description outlines ... λClam system for proof planning in higher-order logic. The usefulness and feasibility of applying ... higher-order proof planning to a number of types of problem is outlined, in particular...
  • Church

  • Referenced in 39 articles [sw08946]
  • which parameters cluster over trials, infinite PCFGs, planning by inference, and various non-parametric clustering...