000 03989nam a22003735i 4500
001 299163
003 MX-SnUAN
005 20160429155536.0
007 cr nn 008mamaa
008 150903s2009 gw | o |||| 0|eng d
020 _a9783642020117
_99783642020117
024 7 _a10.1007/9783642020117
_2doi
035 _avtls000353228
039 9 _a201509030509
_bVLOAD
_c201405060317
_dVLOAD
_y201402180939
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aVahrenhold, Jan.
_eeditor.
_9335941
245 1 0 _aExperimental Algorithms :
_b8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings /
_cedited by Jan Vahrenhold.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5526
500 _aSpringer eBooks
505 0 _aParallelism in Current and Future Processors – Challenges and Support for Designing Optimal Algorithms -- From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering -- Experimental Comparisons of Derivative Free Optimization Algorithms -- On Computational Models for Flash Memory Devices -- Competitive Buffer Management with Stochastic Packet Arrivals -- Fast and Accurate Bounds on Linear Programs -- Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study -- Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy -- psort, Yet Another Fast Stable Sorting Software -- A Heuristic for Fair Correlation-Aware Resource Placement -- Measuring the Similarity of Geometric Graphs -- A Heuristic Strong Connectivity Algorithm for Large Graphs -- Pareto Paths with SHARC -- An Application of Self-organizing Data Structures to Compression -- Scheduling Additional Trains on Dense Corridors -- Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays -- Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games -- Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching -- Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow -- Univariate Algebraic Kernel and Application to Arrangements -- Fast Algorithm for Graph Isomorphism Testing -- Algorithms and Experiments for Clique Relaxations—Finding Maximum s-Plexes -- A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs -- Multi-level Algorithms for Modularity Clustering -- Bulk-Insertion Sort: Towards Composite Measures of Presortedness -- Computing Elevation Maxima by Searching the Gauss Sphere.
520 _aThis 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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642020100
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-02011-7
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c299163
_d299163