000 04696nam a22003975i 4500
001 300234
003 MX-SnUAN
005 20160429155620.0
007 cr nn 008mamaa
008 150903s2009 gw | o |||| 0|eng d
020 _a9783642022708
_99783642022708
024 7 _a10.1007/9783642022708
_2doi
035 _avtls000353302
039 9 _a201509030514
_bVLOAD
_c201405060318
_dVLOAD
_y201402180941
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aDeng, Xiaotie.
_eeditor.
_9329845
245 1 0 _aFrontiers in Algorithmics :
_bThird International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings /
_cedited by Xiaotie Deng, John E. Hopcroft, Jinyun Xue.
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 ;
_v5598
500 _aSpringer eBooks
505 0 _aFAW 2009 -- Study on Parallel Computing -- Communication Complexity and Its Applications -- Algorithmic Problems in Computer and Network Power Management -- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains -- Edge Search Number of Cographs in Linear Time -- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems -- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs -- Covering-Based Routing Algorithms for Cyclic Content-Based P/S System -- On the ?-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games -- Cop-Robber Guarding Game with Cycle Robber Region -- Covered Interest Arbitrage in Exchange Rate Forecasting Markets -- CFI Construction and Balanced Graphs -- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions -- Space–Query-Time Tradeoff for Computing the Visibility Polygon -- Square and Rectangle Covering with Outliers -- Processing an Offline Insertion-Query Sequence with Applications -- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs -- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs -- On Modulo Linked Graphs -- Pathwidth is NP-Hard for Weighted Trees -- A Max-Margin Learning Algorithm with Additional Features -- DDoS Attack Detection Algorithm Using IP Address Features -- Learning with Sequential Minimal Transductive Support Vector Machine -- Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams -- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set -- Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks -- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems -- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning -- Approximating Scheduling Machines with Capacity Constraints -- Approximating the Spanning k-Tree Forest Problem -- Toward an Automatic Approach to Greedy Algorithms -- A Novel Approximate Algorithm for Admission Control -- On the Structure of Consistent Partitions of Substring Set of a Word -- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet -- An Improved Database Classification Algorithm for Multi-database Mining -- Six-Card Secure AND and Four-Card Secure XOR.
520 _aThis book constitutes the refereed proceedings of the Third International Frontiers of Algorithmics Workshop, FAW 2009, held in Hefei, Anhui, China, in June 2009. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on graph algorithms; game theory with applications; graph theory, computational geometry; machine learning; parameterized algorithms, heuristics and analysis; approximation algorithms; as well as pattern recognition algorithms, large scale data mining.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aHopcroft, John E.
_eeditor.
_9337507
700 1 _aXue, Jinyun.
_eeditor.
_9337508
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642022692
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-02270-8
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c300234
_d300234