Filters
cris logo
-
New search Filters
Select from list
Displayed from Show more
You have reached the maximum number of displayed search results.
All results displayed
No results are available for the search performed
Displayed from
You have reached the maximum number of displayed search results.
All results displayed
Loading results
Obtaining statistical data

Projects / Programmes source: ARRS

Exact and nonexact algorithms and techniques

Edit
Research activity

Code Science Field Subfield
2.07.00  Engineering sciences and technologies  Computer science and informatics   

Code Science Field
P170  Natural sciences and mathematics  Computer science, numerical analysis, systems, control 
Keywords
algorithm, approximation algorithm, probabilistic/randomized algorithm, optimization, computational complexity, software, distributed computer system, grid computng, data replication, routing, optimal assignment, alocation and placement, compiler, language translation, syntax analyisis.
Evaluation (rules)
source: COBISS
Citations Citations for bibliographic records in COBIB.SI that are linked to records in citation databases
source: WoS source: Scopus source: COBISS
Researchers (5)
no. Code Name and surname Research area Role Period No. of publications
1.  23400  PhD Uroš Čibej  Engineering sciences and technologies  Junior researcher  2004 - 2007  69 
2.  18188  PhD Tomaž Dobravec  Engineering sciences and technologies  Researcher  2004 - 2007  133 
3.  22475  PhD Jurij Mihelič  Engineering sciences and technologies  Researcher  2004 - 2007  142 
4.  04646  PhD Borut Robič  Engineering sciences and technologies  Principal Researcher  2004 - 2007  291 
5.  01902  PhD Boštjan Vilfan  Natural sciences and mathematics  Researcher  2004 - 2007  189 
Organisations (1)
no. Code Research organisation City Registration number No. of publications
1.  1539  University of Ljubljana, Faculty of Computer and Information Science  Ljubljana  1627023  14,460 
Abstract
The research project contains (a) fundamental research of exact and nonexact algorithms and techniques for solving NP-hard computational problems, and (b) the design, analysis, and application of exact and nonexact algorithms and techniques to solve specific NP-hard problems that arise in the areas of facility location theory, data routing, data replication, and problems in program language translation. The basic research of nonexact techniques will be focused on approximation algorithms, probabilistic/randomized algorithms, and other modern heuristic algorithms and techniques for solving hard computational problems. We will also study the characteristics and properties that make computational problems amenable to exact and nonexact techniques. In the application directed research of exact and nonexact problem solving, we will focus on several topical application areas that include facility location problems (e.g. efficient placement of services such as stores, warehouses, transmitters, computer servers, etc. in a given space, such as building, city, region, state, etc.); distributed computing (e.g. efficient data replication in a distributed computing environment); routing problems (e.g. efficient routing in computer networks with regular topology); and efficient program language translation (e.g. syntax directed translation with combination of bottom-up and top-down syntax analysis).
Confirmation required
Views history
Favourite