16 articles – 42 notices  [english version]
.:. Derniers dépôts .:.
30 documents classés par :
1 - 2 - 3 Page Suivante Page Finale
Optimal Data Placement on Networks With Constant Number of Clients
Angel E., Bampis E., Pollatos G. G., Zissimopoulos V.
CoRR abs, 1004.4420 (2010) elec. proc. [hal-00668033 - version 1]
Speed Scaling on Parallel Processors with Migration
Angel E., Bampis E., Kacem F., Letsios D.
CoRR abs/1107.2105, 1107.2105 (2011) elec. proc. [hal-00668031 - version 1]
Randomized truthful algorithms for scheduling selfish tasks on parallel machines
Angel E., Bampis E., Thibault N.
Theoretical Computer Science 414, 1 (2012) 1--8 [hal-00666667 - version 1]
On the truthfulness and the approximation for scheduling selfishtasks
Angel E., Bampis E., Pascual F., Tchetgnia A.-A.
Journal of Scheduling 12, 5 (2009) 437--445 [hal-00654128 - version 1]
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities
Angel E., Campigotto R., Laforest C.
Algorithmic Operations Research 6, 1 (2011) 56--67 [hal-00653634 - version 1]
Polynomial approximation for multi-criteria combinatorial optimization problems
Angel E., Gourvès L., Bampis E.
Dans Combinatorial Optimization Volume 2, Paradigms of Combinatorial Optimization (2010) 511--546 [hal-00645856 - version 1]
On the truthfulness and the approximation for scheduling selfishtasks
Angel E., Bampis E., Pascual F., Tchetgnia A.-A.
Dans Proc. of the 19th annual ACM symposium on Parallel algorithms and architectures (SPAA '07) - 19th annual ACM symposium on Parallel algorithms and architectures (SPAA '07), États-Unis (2007) [hal-00644642 - version 1]
Randomized truthful algorithms for scheduling selfish tasks on parallel machines
Angel E., Bampis E., Thibault N.
Dans Proc. of the 9th Latin American Theoretical Informatics Symposium (LATIN 2010) - 9th Latin American Theoretical Informatics Symposium (LATIN 2010), Mexique (2010) [hal-00644622 - version 1]
On the minimum hitting set of bundles problem
Angel E., Bampis E., Gourvès L.
Theoretical Computer Science 410, 45 (2009) 4534--4542 [hal-00644535 - version 1]
fulltext access Algorithmes d'approximation pour l'optimisation en ligne d'ordonnancements et de structures de communications.
Thibault N.
Université d'Evry-Val d'Essonne (24/11/2006), Christian Laforest (Dir.) [tel-00422420 − version 1]