|
|
|
|
LEADER |
02667nam a22005535i 4500 |
001 |
7175 |
003 |
DE-He213 |
005 |
20130725191934.0 |
007 |
cr nn 008mamaa |
008 |
100301s2009 gw | s |||| 0|eng d |
020 |
# |
# |
|a 9783642020117
|9 978-3-642-02011-7
|
024 |
7 |
# |
|a 10.1007/978-3-642-02011-7
|2 doi
|
050 |
# |
4 |
|a QA76.9.A43
|
072 |
# |
7 |
|a UMB
|2 bicssc
|
072 |
# |
7 |
|a COM051300
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
100 |
1 |
# |
|a Vahrenhold, Jan.
|e editor.
|
245 |
1 |
0 |
|a Experimental Algorithms
|b 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings /
|c edited by Jan Vahrenhold.
|h [electronic resource] :
|
264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
300 |
# |
# |
|b online resource.
|
336 |
# |
# |
|a text
|b txt
|2 rdacontent
|
337 |
# |
# |
|a computer
|b c
|2 rdamedia
|
338 |
# |
# |
|a online resource
|b cr
|2 rdacarrier
|
347 |
# |
# |
|a text file
|b PDF
|2 rda
|
490 |
1 |
# |
|a Lecture Notes in Computer Science,
|v 5526
|x 0302-9743 ;
|
520 |
# |
# |
|a This book constitutes the refereed proceedings of the 8th International Symposium on Experimental and Efficient Algorithms, SEA 2009, held in Dortmund, Germany, in June 2009. The 23 revised full papers were carefully reviewed and selected from 64 submissions and present current research on experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. Contributions are supported by experimental evaluation, methodological issues in the design and interpretation of experiments, the use of (meta-) heuristics, or application-driven case studies that deepen the understanding of a problem's complexity.
|
650 |
# |
0 |
|a Computer science.
|
650 |
# |
0 |
|a Operating systems (Computers).
|
650 |
# |
0 |
|a Data structures (Computer science).
|
650 |
# |
0 |
|a Computer software.
|
650 |
# |
0 |
|a Logic design.
|
650 |
# |
0 |
|a Computational complexity.
|
650 |
# |
0 |
|a Algorithms.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Data Structures, Cryptology and Information Theory.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Performance and Reliability.
|
710 |
2 |
# |
|a SpringerLink (Online service)
|
773 |
0 |
# |
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642020100
|
830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 5526
|x 0302-9743 ;
|
856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-02011-7
|
912 |
# |
# |
|a ZDB-2-SCS
|
912 |
# |
# |
|a ZDB-2-LNC
|
950 |
# |
# |
|a Computer Science (Springer-11645)
|