000			03842nam a22004095i 4500
001			290554
003			MX-SnUAN
005			20160429154751.0
007			cr nn 008mamaa
008			150903s2013 xxu| o |||| 0|eng d
020			_a9781461468257 _99781461468257
024	7		_a10.1007/9781461468257 _2doi
035			_avtls000342018
039		9	_a201509030344 _bVLOAD _c201405050237 _dVLOAD _y201402061115 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.M35
100	1		_aAlpern, Steve. _eeditor. _9321337
245	1	0	_aSearch Theory : _bA Game Theoretic Perspective / _cedited by Steve Alpern, Robbert Fokkink, Leszek G?sieniec, Roy Lindelauf, V.S. Subrahmanian.
264		1	_aNew York, NY : _bSpringer New York : _bImprint: Springer, _c2013.
300			_aviii, 303 páginas 44 ilustraciones _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
500			_aSpringer eBooks
505	0		_aSearch Games: A review -- Search Games for an Immobile Hider -- Tools to manage Search Games on Lattices -- Network Coloring and Colored Coin Games -- Open Problems on Search Games -- Some Cinderella Ruckle Type Games -- The Cardinality of the Sets involved in Lattice Games -- Effective Search for a Naval Mine with Application to Distributed Failure Detection -- The Value of the Two Cable Ambush Game -- How to poison your mother-in-law and other caching problems -- Rendezvous Problem -- Deterministic Symmetric Rendezvous in Arbitrary Graphs -- Gathering asynchronous and oblivious robots on basic graph topologies -- Ten Open Problems in Rendezvous Search -- Interactions between searching predators and hidden prey -- A discrete search-ambush game with a silent predator -- A Model of Partnership Formation with Friction and Multiple Criteria -- Applications of search in Biology: some open problems.
520			_aSearch games and rendezvous problems have received growing attention in computer science within the past few years.  Rendezvous problems emerge naturally, for instance, to optimize performance and convergence of mobile robots. This gives a new algorithmic point of view to the theory. Furthermore, modern topics such as the spreading of gossip or disease in social networks have lead to new challenging problems in search and rendezvous. Search Theory: A Game Theoretic Perspective introduces the first integrated approach to Search and Rendezvous from the perspectives of  biologists, computer scientists and mathematicians. This contributed volume covers a wide range of topics including rendezvous problems and solutions, rendezvous on graphs, search games on biology, mobility in governed social networks, search and security, and more.  Most chapters also include case studies or a  survey, in addition to a chapter on the future direction of Search and Rendezvous research. This book targets researchers and practitioners working in computer science, mathematics and biology as a reference book.  Advanced level students focused on these fields will also find this book valuable as a secondary text book or reference.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aFokkink, Robbert. _eeditor. _9321338
700	1		_aG?sieniec, Leszek. _eeditor. _9321339
700	1		_aLindelauf, Roy. _eeditor. _9321340
700	1		_aSubrahmanian, V.S. _eeditor. _9317814
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9781461468240
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-4614-6825-7 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c290554 _d290554