All
All

What are you looking for?

All
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

-
19852030

Join usingOrAnd

Join usingOrAnd

SelectAll/None
    • Show more

    • Show more

    • Show more

    • Show more

  • Show more

SelectAll/None

Join usingOrAnd

-

More filters

Projects

6 479 projects (0,133s)

Project

Exploitation of constraint satisfaction problem solving techniques in e-learning (GA406/09/0346)

process more efficient. In the proposed project, we suggest to transfer the constraint satisfaction problem solving techniques into the e-learning domain. These techniquesare used for automated creation of multimedia and f...

AM - Pedagogika a školství

  • 2009 - 2011
  • 967 tis. Kč
  • 967 tis. Kč
  • GA ČR
Project

Predicate graded logics and their applications to computer science (GA17-04630S)

particular problems in computer science which heavily involve graded notions: representation of vague and uncertain knowledge, valued constraint satisfaction problems partially developed and scarcely appl...

IN - Informatika

  • 2017 - 2021
  • 6 926 tis. Kč
  • 5 714 tis. Kč
  • GA ČR
Project

Graphs, Grupoids and Algorithms (MEB040915)

The primary goals of the co-operation are to foster the study of the frontier of algebra, algorithms and graph theory, to provide an opportunity for Czech and Hungarian researchers to exchange ideas related to these areas, and to obtain new theoretic...

BA - Obecná matematika

  • 2009 - 2010
  • 110 tis. Kč
  • 102 tis. Kč
  • MŠMT
Project

An Algebraic Approach to the Constraint Satisfaction Problem (MEB050817)

The main goal of the cooperation is to provide an opportunity for Czech and Polish researchers to share their experience and exchange the ideas concerning the Constraint Satisfaction Problem, namely the dichotomy question. ...

BA - Obecná matematika

  • 2008 - 2009
  • 90 tis. Kč
  • 85 tis. Kč
  • MŠMT
Project

Constraint satisfaction problem and universal algebra (GP201/09/P223)

The subject of the project is the computational complexity of the Constraint Satisfaction Problem (CSP). The goal is to prove the dichotomy conjecture of Feder and Vardi for a broad class of CSP problems. In partic...

BA - Obecná matematika

  • 2009 - 2011
  • 633 tis. Kč
  • 633 tis. Kč
  • GA ČR
Project

LeCoS merging machine LEarning and COnstraint Satisfaction (GA201/08/0509)

We propose to merge advanced techniques of two mature research fields: relational machine learning (RML) on one hand, and constraint satisfaction (CS and the constraint satisfaction parts. This will likely result i...

IN - Informatika

  • 2008 - 2010
  • 1 938 tis. Kč
  • 1 938 tis. Kč
  • GA ČR
Project

General algebra and its connections to computer science (GA13-01832S)

The aim of the project is to solve selected problems in areas on the border of general algebra and computer science. We will focus on the following problems: complexity of the constraint satisfaction problems

BA - Obecná matematika

  • 2013 - 2017
  • 6 852 tis. Kč
  • 6 852 tis. Kč
  • GA ČR
Project

Logic programs with constrains (GA201/99/D057)

satisfaction. Special emphasis will be put on solving over-constraints problems and optimisation problems with respect to preserving declarative character of constraintsConstraint Programming is ...

JC - Počítačový hardware a software

  • 1999 - 2002
  • 665 tis. Kč
  • 540 tis. Kč
  • GA ČR
Project

Algebraic Methods in the Representation Theory (Approximations, Realizations, and Constraints) (GA201/09/0816)

The proposed five year project of basic research is focused on the following three areas of contemporary algebra:(i) The structure of projective and tilting modules over associative rings, and their applications.(ii) Algebraic representations of latt...

BA - Obecná matematika

  • 2009 - 2013
  • 2 382 tis. Kč
  • 2 382 tis. Kč
  • GA ČR
Project

Constraint programming and Boolean satisfiability for artificial intelligence (GP201/09/P318)

The aim of the project is to improve constraint programming and Boolean satisfaction techniques to provide more efficiency in solving problems motivated for relaxing hard problems arising in constraint pro...

IN - Informatika

  • 2009 - 2011
  • 882 tis. Kč
  • 882 tis. Kč
  • GA ČR
  • 1 - 10 out of 6 479