GRAPHITE 2012 - First Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE)
Topics/Call fo Papers
First Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE)
The topic of the event is graph search in all its forms in computer science. Graph search algorithms tend to have common characteristics, such as duplicate detection, independent of their application domain. Over the past few years, it has been shown that the scalability of such algorithms can be dramatically improved by using, e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processing units, and by using heuristics to guide the search. The goal of this event is to gather scientists from different communities, such as model checking, artificial intelligence planning, game playing, and algorithm engineering, who do research on graph search algorithms, such that awareness of each others' work is increased.
The topic of the event is graph search in all its forms in computer science. Graph search algorithms tend to have common characteristics, such as duplicate detection, independent of their application domain. Over the past few years, it has been shown that the scalability of such algorithms can be dramatically improved by using, e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processing units, and by using heuristics to guide the search. The goal of this event is to gather scientists from different communities, such as model checking, artificial intelligence planning, game playing, and algorithm engineering, who do research on graph search algorithms, such that awareness of each others' work is increased.
Other CFPs
- Fourth International Workshop on Foundations of Interface Technologies (FIT)
- 8th Workshop on Fixed Points in Computer Science (FICS)
- 9th International Workshop on Formal Engineering approaches to Software Components and Architectures (FESCA)
- Third International workshop on Developments in Implicit Computational complExity (DICE)
- 11th International Workshop on Coalgebraic Methods in Computer Science (CMCS)
Last modified: 2011-07-26 18:08:24