• Nem Talált Eredményt

Moln´ar Mikl´os

N/A
N/A
Protected

Academic year: 2022

Ossza meg "Moln´ar Mikl´os"

Copied!
1
0
0

Teljes szövegt

(1)

Moln´ ar Mikl´ os

Moln´ar Mikl´os jelenleg az INSA (Institut National des Sciences Appliqu´ees, Rennes, Franciaorsz´ag) Informatika tansz´ek´en maˆıtre de conf´erences. Villa- mosm´ern¨oki oklevelet 1976-ban szerzett a BME-n. A BME SZAK tudom´anyos munkat´arsa majd megb´ızott igazgat´oja volt 1989-ig. 1989-t´ol megh´ıv´assal az INSA Informatika tansz´ek´en dolgozott. 1991-ben informatikai Ph.D. fokoza- tot szerzett a Rennes 1 egyetemen. 1992-t˝ol maˆıtre de conf´erences az INSA- n. Habilit´aci´aos dolgozat´at a korl´atozott optim´alis multicast ´utvonalkeres´es t´emak¨or´eben v´edte meg 2008-ban, P´arizsban. Kutat´omunk´aj´at az IRISA-n (Institut de Recherche en Informatique et Syst`emes Al´eatoires) v´egzi. Ku- tat´asi ter¨ulete a kombinatorikai optimaliz´al´as, a neh´ez optimaliz´al´asi felada- tok algoritmikus megold´asa els˝osorban h´al´ozatokhoz kapcsol´od´o probl´em´akban (m´eretez´es, optim´alis ´utvonalkeres´es, korl´atozott optim´alis ´utvonalak, multicast

´

utvonalak, hibat˝ur˝o ´utvonalak tervez´ese, optikai ´es vezet´ek n´elk¨uli h´al´ozatok op- timaliz´al´asa).

CV ´es a legfrisebb publik´aci´ok:

http://www.irisa.fr/prive/molnar/MMang.html

Short biography

Moln´ar Mikl´os is currently an associate professor with the Computer Science department of INSA Rennes, France. He received the Dipl. Ing. degree in electrical engineering from the University of Technology, Budapest (BME) in 1976 and the Ph.D. degree in Computer Science from the University of Rennes 1 in 1991. He received the ”Habilitation pour Diriger les Recherches ” french scientific degree in 2008. He was a researcher and the director of the Center of Computer Applications (SZAK) of the University of Technology of Budapest until 1989. He was invited by the CS department of INSA in 1989 and he is an associated professor since 1992. He is currently a member of IRISA, joint re- search laboratory in Computer Science at Rennes. His research interests are in the combinatorial optimization, algorithmic solution of hard optimization prob- lems related to networks (network design, optimal routing, routing with con- straints, multicast routing, dependable network design, optimization of route protections, optimizations in optical and wireless networks).

CV and recent publications:

http://www.irisa.fr/prive/molnar/MMang.html

1

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

(Note that with hierarchical routing, there are actually several instances of the routing protocol operating within a single layer: one instance for each routing hierarchy

The first classic result in the topic of VLSI routing is probably Gallai’s linear time algorithm that solves the single row routing problem — a special case of channel routing —

If each wire in the solution of a channel routing problem in the 2-layer Manhattan model contains a single horizontal wire segment only, then the solution is called dogleg free..

The company has three centers where Tshirts can be manufactured and these centers have a capacity of turning out 230, 280, and 190 pieces of Tshirts per day, respectively, regardless

In this study, the artificial neural network (ANN) with optimization algorithms, including particle swarm optimization (PSO), Archimedes optimization algorithm (AOA), and

Design a polynomial time algorithm which uses A several times and nds a hamiltonian cycle in any given

A county want to build a sewage system which connects all the towns and the wastewater treatment facility.. The above graph represents

In the left network given in the rst problem, replace the top-left edge's capacity (which was 8) by a parameter p... In the given network each number in a round bracket is the