AAIM: Algorithmic Applications in Management

FacebookTwitterLinkedInGoogle

 

Past:   Proceedings on DBLP

Future:  Post a CFP for 2015 or later   |   Invite the Organizers Email

 
 

All CFPs on WikiCFP

Event When Where Deadline
AAIM 2014 The 10th International Conference on Algorithmic Aspects of Information and Management
Jul 8, 2014 - Jul 11, 2014 Vancouver, BC, Canada Feb 23, 2014
 
 

Present CFP : 2014

The 2014 AAIM Conference July 8-11, 2014
Simon Fraser University, Vancouver, Canada
AAIM2014 Website

The Tenth International Conference on Algorithmic Aspects of Information and Management (AAIM 2014) will be held on July 8-11, 2014 at Harbour Centre, Simon Fraser University, Vancouver, Canada.

The Conference will provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.

Interesting new results in all areas of algorithmics, operation research and combinatorial optimization and their applications are welcome. In addition to theoretical work, we are also interested in results that report on experimental and applied research of general algorithmic interest. Special considerations will be given to algorithmic research that is motivated by real-world applications. Experimental and applied papers are expected to show convincingly the usefulness and efficiency of the target algorithms in practical settings.

Typical, but not exclusive, topics of interest include:


Algorithms and data structures;
Algorithmic game theory and incentive analysis;
Approximation algorithms and online algorithms;
Automata, languages, logic, and computability;
Bioinformatics, computational biology and medicine, and biomedical applications;
Biomedical imaging algorithms;
Combinatorial optimization;
Combinatorics and discrete structures related to algorithms and complexity;
Communication networks and optimization;
Complexity theory;
Computational algebra, geometry, number theory, and statistics;
Computational learning theory, knowledge discovery, and data mining;
Cryptography, reliability, and security;
Database theory, large databases, and natural language processing;
Experimental algorithmic methodologies;
Geometric information processing and communication;
Graph algorithms and theory;
Graph drawing and information visualization;
Internet algorithms and protocols;
Large graph algorithms and social network analysis;
Optimization algorithms in economic and operations research;
Parallel and distributed computing and multicore algorithms;
Parameterized algorithms, heuristics, and analysis;
Pattern recognition algorithms;
Trustworthy algorithms and trustworthy software.

Submissions:

The submission deadline is February 23, 2014 (anywhere on Earth). AAIM'2014 will only accept electronic (PS or PDF) submissions via the submission website.

E-mails will be sent to the authors to confirm the receipt of their submissions within 24 hours. For any problem or question on submissions, please send e-mails to aaim2014@easychair.org

Only previously unpublished new results will be considered for publication. Papers that have already been published at another journal or conference with proceedings, or simultaneously submitted or accepted to another conference with proceedings will not be considered.

A submission should start with the title of the paper, each author's name, affiliation, and e-mail address, and a one-paragraph summary of the results. This should be followed by a scholarly exposition of the ideas, techniques, and a full description of the results achieved. A clear indication of the motivation and comparison with prior or related work should be presented. The paper should not exceed 10 pages, excluding bibliography and appendices, formatted for letter-size paper using 11 point or larger font, with at least one inch margins around.

Submissions that deviate significantly from these guidelines or are unprintable risk rejection without consideration of their merit.

The Proceedings of the Conference will be published by Springer in the Lecture Notes in Computer Science (LNCS) series, and will be available for distribution at the conference.

Invited Speakers:

Ming Li (University of Waterloo, Canada)

Approximating Semantics
Latent search engines and question-answering (QA) engines fundamentally depend on our intuitive notion of semantics and semantic distance. However, such a semantic distance is likely undefinable, certainly un-computable, and often blindly approximated. Can we develop a theoretical framework for this area?
I will describe a theory, using the well-defined information distance, to approximate the elusive semantic distance such that it is mathematically proven that our approximation is "better than" any computable approximation of the intuitive concept of semantic distance. Although information distance itself is obviously also not computable, it does allow a natural approximation by compression. We will then describe a natural language encoding system to implement our theory followed by experiments on a QA system.

Christos H. Papadimitriou (University of California - Berkely, USA)

Computational Insights and the Theory of Evolution
Covertly computational ideas have influenced the Theory of Evolution from the very start. This talk is about recent work on Evolution that was inspired and informed by computational insights. Considerations about the performance of genetic algorithms led to a novel theory of the role of sex in Evolution based on the concept of mixability, while the equations describing the evolution of a species can be reinterpreted as a repeated game between genes played through the multiplicative updates algorithm. Finally, a theorem on Boolean functions helps us understand better Waddington's genetic assimilation as well as mechanisms for the emergence of novelty in Life.

Special Issues:

Selected high quality papers will be invited to a special issue in the journal of Theoretical Computer Science and in the Journal of Combinatorial Optimization, respectively. The invited papers will go through the normal reviewing process.

Awards

The Best Paper and the Best Student Paper will be selected for award. A paper is eligible for the Best Student Paper Award only if all authors are full-time students at the time of submission. To indicate the eligibility of a submission for the Best Student Paper Award, please add the phrase "Eligible for Best Student Paper Award" in a separate line at the end of the "Abstract" field in the web form on the submission server as well as in the submitted paper. The Committee reserves the right to decide whether to make an award or not.


Important Dates:

Submission Deadline: February 23, 2014 (anywhere on Earth)
Author Notificatione: March 31, 2014
Final Manuscript Due: April 15, 2014
Conference: July 8-11, 2014
 

Related Resources

ICIEM 2016   International Conference on Integrated Environmental Management for Sustainable Development
CIKM 2017   The 26th 2017 ACM Conference on Information and Knowledge Management
IPMU 2018   17th Information Processing and Management of Uncertainty in Knowledge-Based Systems Conference
AKM 2017   Call for Book Chapters: Analytics and Knowledge Management (Taylor & Francis Group)
DICTAP 2017   The Seventh International Conference on Digital Information and Communication Technology and Applications
NeuroIS 2017   Gmunden Retreat on NeuroIS 2017
SSR-SSI 2017   2017 2nd SSR International Conference on Social Sciences and Information
ISD 2017   Information Systems Development
ICONIP 2017   International Conference on Neural Information Processing
ICITA 2017   International Conference on Information Technology and Applications