PREPROCESSING

RIGOROUS THEORY OF PREPROCESSING

Coordinatore	UNIVERSITETET I BERGEN    more Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie.
Nazionalità Coordinatore	Norway [NO]
Totale costo	2˙227˙051 €
EC contributo	2˙227˙051 €
Programma	FP7-IDEAS-ERC Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013)
Code Call	ERC-2010-AdG_20100224
Funding Scheme	ERC-AG
Anno di inizio	2011
Periodo (anno-mese-giorno)	2011-04-01   -   2016-03-31

 Partecipanti

#	participant	country	role	EC contrib. [€]
1	UNIVERSITETET I BERGEN  Organization address address: Museplassen 1 city: BERGEN postcode: 5007 contact info Titolo: Ms. Nome: Liv-Grethe Cognome: Gudmundsen Email: send email Telefono: 4755584965 Fax: 4755584991	NO (BERGEN)	hostInstitution	2˙227˙051.00
2	UNIVERSITETET I BERGEN  Organization address address: Museplassen 1 city: BERGEN postcode: 5007 contact info Titolo: Prof. Nome: Fedor Cognome: Fomin Email: send email Telefono: 4755584024 Fax: 4755584199	NO (BERGEN)	hostInstitution	2˙227˙051.00

Mappa

 Word cloud

Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.

 Obiettivo del progetto (Objective)

'The main research goal of this project is the quest for rigorous mathematical theory explaining the power and failure of heuristics. The incapability of current computational models to explain the success of heuristic algorithms in practical computing is the subject of wide discussion for more than four decades. Within this project we expect a significant breakthrough in the study of a large family of heuristics: Preprocessing (data reduction or kernelization). Preprocessing is a reduction of the problem to a simpler one and this is the type of algorithms used in almost every application. As key to novel and groundbreaking results, the proposed project aims to develop new theory of polynomial time compressibility. Understanding the origin of compressibility will serve to build more powerful heuristic algorithms, as well as to explain the behaviour of preprocessing. The ubiquity of preprocessing makes the theory of compressibility extremely important. The new theory will be able to transfer the ideas of efficient computation beyond the established borders.'