In the light of continuously increasing interaction between communication and computing, there arise a number of interesting, and difficult algorithmic issues in diverse areas including coverage, mobility, routing, cooperation, capacity planning, scheduling, and power control. The aim of TAPAS is to provide a forum for presentation of original research in the design, implementation and evaluation of algorithms. TAPAS is dedicated to the use, design and evaluation of algorithms for combinatorial optimization problems (either efficient optimal or efficient approximation algorithms) and to real-world applications, engineering and experimental analysis of algorithms. It aims, in particular, at fostering the cooperation among researchers in computer science, networking, discrete mathematics, mathematical programming and operations research.

International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS / MARCHETTI SPACCAMELA, Alberto; M., Segal. - (2011). (Intervento presentato al convegno International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS tenutosi a Roma nel 18-20 Aprile 2011).

International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS

MARCHETTI SPACCAMELA, Alberto;
2011

Abstract

In the light of continuously increasing interaction between communication and computing, there arise a number of interesting, and difficult algorithmic issues in diverse areas including coverage, mobility, routing, cooperation, capacity planning, scheduling, and power control. The aim of TAPAS is to provide a forum for presentation of original research in the design, implementation and evaluation of algorithms. TAPAS is dedicated to the use, design and evaluation of algorithms for combinatorial optimization problems (either efficient optimal or efficient approximation algorithms) and to real-world applications, engineering and experimental analysis of algorithms. It aims, in particular, at fostering the cooperation among researchers in computer science, networking, discrete mathematics, mathematical programming and operations research.
2011
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/425823
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact