|
Showing 1 - 4 of
4 matches in All Departments
|
Stochastic Algorithms: Foundations and Applications - Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 (Paperback, 2005 ed.)
Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhoefel
|
R1,630
Discovery Miles 16 300
|
Ships in 10 - 15 working days
|
This volume constitutes the proceedings of the 3rd Symposium on
Stochastic Algorithms, Foundations and Applications (SAGA 2005),
held in Moscow, R- sia, at Moscow State University on October
20-22, 2005. The symposium was organized by the Department of
Discrete Mathematics, Faculty of Mechanics and Mathematics of
Moscow State University and was partially supported by the Russian
Foundation for Basic Research under Project No. 05-01-10140-?. The
SAGA symposium series is a biennial meeting which started in 2001
in Berlin, Germany(LNCS vol. 2264). The second symposium was held
in Sept- ber 2003 at the University of Hertfordshire, Hat?eld, UK
(LNCS vol. 2827). Sincethe?rstsymposiuminBerlinin2001,
anincreasedinterestintheSAGA series can be noticed. For SAGA 2005,
we received submissions from China, the European Union, Iran,
Japan, Korea, Russia, SAR Hong Kong, Taiwan, and USA, fromwhich 14
papers were?nally selected for publication after a thorough
reviewing process. The contributed papers included in this volume
cover both theoretical as well as applied aspects of stochastic
computations, which is one of the main aims of the SAGA series.
Furthermore, ?ve invited lectures were delivered at SAGA 2005: The
talk by Alexander A. Sapozhenko (Moscow State University)
summarizes results on the container method, a technique that is
used to solve enumeration problems for various combinatorial
structures and which has - merous applications in the design
andanalysisof stochasticalgorithms. Christos D. Zaroliagis
(University of Patras) presented recent advances in multiobjective
optimization
The second Symposium on Stochastic Algorithms, Foundations and
Applications (SAGA 2003), took place on September 22 23,2003, in
Hat?eld, England.The present volume comprises 12 contributed papers
and 3 invited talks. The contributed papers included in the
proceedings present results in the following areas: ant colony
optimization; randomized algorithmsfor the intersection problem; -
cal search for constraint satisfaction problems; randomized local
search methods for combinatorial optimization, in particular,
simulated annealing techniques; probabilistic global search
algorithms; network communication complexity; open shop scheduling;
aircraft routing; traf?c control; randomized straight-line
programs; and stochastic - tomata and probabilistic
transformations.
TheinvitedtalkbyRolandKirschnerprovidesabriefintroductiontoquantuminf-
matics. The requirements and the prospects of the physical
implementation of a qu- tum computer are addressed. Lucila
Ohno-Machado and Winston P. Kuo describe the factors that make the
an- ysis of high-throughput gene expression data especially
challenging, and indicate why properly evaluated stochastic
algorithms can play a particularly important role in this process.
John Vaccaro et al. review a fundamental element of quantum
information theory, source coding, which entails the compression of
quantum data. A recent experiment that demonstrates this
fundamental principle is presented and discussed. Our special
thanks go to all who supported SAGA 2003, to all authors who subm-
ted papers, to the members of the program committee, to the invited
speakers, and to the members of the organizing committee. Andreas
Albrecht Kathleen Steinhofel ] Organization
SAGA2003wasorganizedbytheUniversityofHertfordshire,
DepartmentofComputer Science, Hat?eld, Hertfordshire AL10 9AB,
United Kingdom."
This book constitutes the refereed proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2001, held in Berlin, Germany in December 2001. The nine revised full papers presented together with four invited papers were carefully reviewed and selected for inclusion in the book. The papers are devoted to the design and analysis, experimental evaluation, and real-world application of stochasitc algorithms; in particular, new algorithmic ideas involving stochastic decisions and exploiting probabilistic properties of the underlying problem are introduced. Among the application fields are network and distributed algorithms, local search methods, and computational learning.
This volume contains selected papers presented by students at URC*
2010 (Undergraduate Research in Computer Science - Theory and
Applications). The papers cover a wide range of topics, including
algorithm design (in particular, the design of heuristic algorithms
for the maximum-leaf spanning tree problem, and the analysis of
speed scaling algorithms), programming language design (in
particular, language based security, the use of effect systems for
automating model extraction, and results on adaptation languages
using visual environments) and applications to ray tracing optical
phenomena and pattern matching in MIDI les. The URC* 2010
conference took place at King's College London, 24-26 March 2010,
in association with a Spring School on Information and Software
Security. URC*2010 brought together undergraduate students,
postgraduate students and leading scientists, with the goal of
promoting research in computer science and interdisciplinary topics
amongst undergraduate students. By introducing students to new
research results and techniques, it encouraged them to start
conducting research and producing research results already during
their undergraduate studies.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
Poor Things
Emma Stone, Mark Ruffalo, …
DVD
R449
R329
Discovery Miles 3 290
|