Share Your Research, Maximize Your Social Impacts
Main Menu
Searching By
PARTNERS
TAPAS 2011 - 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems
Topics/Call fo Papers
TAPAS 2011
1st International ICST Conference on Practice and Theory of Algorithms
in (Computer) Systems
18-20 April 2011 - Rome, Italy
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.
The conference will focus on the design, engineering, theoretical and experimental performance analysis of algorithms for problems arising in different areas of computation. We invite submissions that present significant case studies in theoretical and experimental analysis and evaluation of algorithms with specific areas including communications networks, combinatorial optimization and approximation, parallel and distributed computing, computer systems and architecture, economics, game theory, social networks and the world wide web. Novel uses of discrete algorithms in all disciplines and the evaluation of algorithms for realistic environments are particularly welcome.
Submitted papers will consider a succinct summary of the problem and of the results obtained (emphasizing the significance and potential impact of the research), and a clear comparison with related work, all accessible to non-specialist readers. The remainder of the extended abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution.
The maximum length of the paper (excluding the optional appendix) is 12 pages.
Proofs and any other material omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion.
The proceedings will be published by Springer (Lecture Notes in Computer Science).
1st International ICST Conference on Practice and Theory of Algorithms
in (Computer) Systems
18-20 April 2011 - Rome, Italy
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.
The conference will focus on the design, engineering, theoretical and experimental performance analysis of algorithms for problems arising in different areas of computation. We invite submissions that present significant case studies in theoretical and experimental analysis and evaluation of algorithms with specific areas including communications networks, combinatorial optimization and approximation, parallel and distributed computing, computer systems and architecture, economics, game theory, social networks and the world wide web. Novel uses of discrete algorithms in all disciplines and the evaluation of algorithms for realistic environments are particularly welcome.
Submitted papers will consider a succinct summary of the problem and of the results obtained (emphasizing the significance and potential impact of the research), and a clear comparison with related work, all accessible to non-specialist readers. The remainder of the extended abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution.
The maximum length of the paper (excluding the optional appendix) is 12 pages.
Proofs and any other material omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion.
The proceedings will be published by Springer (Lecture Notes in Computer Science).
Other CFPs
- 28th Annual Symposium on Computational Geometry (SoCG 2012)
- European Conference on Combinatorics, Graph Theory and Applications
- 19th International Colloquium on Structural Information and Communication Complexity
- 37th Workshop on Graph-Theoretic Concepts in Computer Science
- 10-th Cologne-Twente Workshop on graphs and combinatorial optimization
Last modified: 2010-12-12 18:42:02