National Repository of Grey Literature 5 records found  Search took 0.01 seconds. 
Domain Specific Languages in Functional Programming
Rapavá, Jana ; Hric, Jan (advisor) ; Pilát, Martin (referee)
In Artificial Intelligence, especially in area of constraint programming, it's popular to design various modeling languages which allow solving problems on domain level and by using domain specific abstractions. Techniques known from research on Domain-Specific Languages are often useful in this effort. Functional programming languages offer new tools for designing such languages, particularly Domain-Specific Embedded Languages. This work investigates the advantages and disadvantages of using functional programming for designing and implementing a Domain-Specific Embedded Language for state space search problems.
Algorithms based on bounded expansion - implementation and evaluation
Rapavá, Jana ; Dvořák, Zdeněk (advisor) ; Knop, Dušan (referee)
This thesis builds upon the result that a lot of graph classes - namely classes with bounded expansion - have properties which make deciding graph problems definable in first-order logic easier. One very important example of such a problem is subgraph isomorphism. The purpose of this work is to implement and test proposed algorithm for this problem (which has a linear time complexity in relation to the size of graph we are looking for the subgraph in). Powered by TCPDF (www.tcpdf.org)
Domain Specific Languages in Functional Programming
Rapavá, Jana ; Hric, Jan (advisor) ; Pilát, Martin (referee)
In Artificial Intelligence, especially in area of constraint programming, it's popular to design various modeling languages which allow solving problems on domain level and by using domain specific abstractions. Techniques known from research on Domain-Specific Languages are often useful in this effort. Functional programming languages offer new tools for designing such languages, particularly Domain-Specific Embedded Languages. This work investigates the advantages and disadvantages of using functional programming for designing and implementing a Domain-Specific Embedded Language for state space search problems.
Algorithms based on bounded expansion - implementation and evaluation
Rapavá, Jana ; Dvořák, Zdeněk (advisor) ; Knop, Dušan (referee)
This thesis builds upon the result that a lot of graph classes - namely classes with bounded expansion - have properties which make deciding graph problems definable in first-order logic easier. One very important example of such a problem is subgraph isomorphism. The purpose of this work is to implement and test proposed algorithm for this problem (which has a linear time complexity in relation to the size of graph we are looking for the subgraph in). Powered by TCPDF (www.tcpdf.org)
Algorithms based on bounded expansion - implementation and evaluation
Rapavá, Jana ; Dvořák, Zdeněk (advisor) ; Knop, Dušan (referee)
This thesis builds upon the result that a lot of graph classes - namely classes with bounded expansion - have properties which make deciding graph problems definable in first-order logic easier. One very important example of such a problem is subgraph isomorphism. The purpose of this work is to implement and test proposed algorithm for this problem (which has a linear time complexity in relation to the size of graph we are looking for the subgraph in). Powered by TCPDF (www.tcpdf.org)

Interested in being notified about new results for this query?
Subscribe to the RSS feed.