Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS
Content archived on 2022-12-23

Data Flow Systems: Algorithms and Complexity

Objective

DFS-AC aims at developing new algorithmic and complexity-measure techniques for novel conditions in Information Technologies - huge information amounts, data flows with uncertainties, distributed and autonomous parallel computations. Open and hard combinatorial and computational problems are to be elaborated identifying the key algorithmic methodologies. The addressed research area is too broad to be captured and accomplished by uncoordinated and financially restricted research teams, despite of the great scientific value of each one of them. Teams, especially the NIS, comprising the necessary expertise apply for an additional interdisciplinary research/financing (vs. to a network). The collective synergies and complementary researches are very promising in this regard. Currently, completed and ongoing research activities create valuable experiences for particular algorithmic issues: decidability, intractability, approximation, lower bounds, heuristics, etc, which needs to be further integrated in a complementary collaborative manner to achieve a sensitive progress in solving the new and hardest paradigms. Even the simplest paradigm “almost all Boolean functions are exponentially complex but the most complex functions known are still polynomial” is wondering many decades. Successes in studies of monotone complexities, in approximations of SAT are encouraging, but other new requirements appear by the data flows and online algorithms complicating the situations. The two base activity areas of proposed research are -analysis and systematization of different algorithmic approaches and solutions for proven hard combinatorial optimizations, design of algorithms for on line schedules for huge data amounts and uncertainties, will be treated against the complementary achievements of disciplines of Operations Research, Combinatorial Optimization, Theory of Algorithms, Logic Minimization and others, provided by partner teams. A set of interdisciplinary research tasks will address particular problems and algorithms such as Traveling Salesman Problem (TSP), Satisfiability Problem (SAT), Discrete Isoperimetric, Discrete Tomography and others, constructing approximations and heuristics, proving the intractability or complexity estimates. The real East-West collaboration in this area is beneficiary both for science developments and science relations. The main integration emphasis of the proposed project is in bringing together several knowledge-complementary leading tams in algorithmic researches in Europe and NIS.The expected results of the project include: Traditional and online algorithmic researches with complexity estimations, Efficient computational principles for data flow analysis, Algorithms and FOSS software design for complex applied systems such as “hybrid agents’ societies” and “search engines”.

Fields of science (EuroSciVoc)

CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: The European Science Vocabulary.

This project has not yet been classified with EuroSciVoc.
Be the first one to suggest relevant scientific fields and help us improve our classification service

You need to log in or register to use this function

Programme(s)

Multi-annual funding programmes that define the EU’s priorities for research and innovation.

Topic(s)

Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.

Call for proposal

Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.

Data not available

Funding Scheme

Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.

Data not available

Coordinator

Hungarian Academy of Sciences Alfred Renyi, Institute of Mathematics
EU contribution
No data
Address
Realtanoda ul. 13-15
1053 Budapest
Hungary

See on map

Total cost

The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.

No data

Participants (7)

My booklet 0 0