|
|
|
|
LEADER |
03065nam a2200553 4500 |
001 |
978-3-540-45612-4 |
003 |
DE-He213 |
005 |
20191027191352.0 |
007 |
cr nn 008mamaa |
008 |
121227s2001 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540456124
|9 978-3-540-45612-4
|
024 |
7 |
|
|a 10.1007/3-540-45612-0
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q334-342
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
072 |
|
7 |
|a UYQ
|2 thema
|
082 |
0 |
4 |
|a 006.3
|2 23
|
245 |
1 |
0 |
|a Local Search for Planning and Scheduling
|h [electronic resource] :
|b ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers /
|c edited by Alexander Nareyek.
|
250 |
|
|
|a 1st ed. 2001.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2001.
|
300 |
|
|
|a VIII, 176 p.
|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 Artificial Intelligence ;
|v 2148
|
505 |
0 |
|
|a Invited Paper -- Meta-heuristics: The State of the Art -- Combinatorial Optimization -- Solving the Sports League Scheduling Problem with Tabu Search -- Lagrange Multipliers for Local Search on Planning Graphs -- Planning with Resources -- Beyond the Plan-Length Criterion -- An Empirical Evaluation of the Effectiveness of Local Search for Replanning -- Board-Laying Techniques Improve Local Search in Mixed Planning and Scheduling -- Empirical Evaluation of Local Search Methods for Adapting Planning Policies in a Stochastic Environment -- Related Approaches -- The GRT Planner: New Results -- Incremental Local Search for Planning Problems -- Map Drawing Based on a Resource-Constrained Search for a Navigation System.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Numerical analysis.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
1 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
650 |
2 |
4 |
|a Theory of Computation.
|0 http://scigraph.springernature.com/things/product-market-codes/I16005
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
650 |
2 |
4 |
|a Numeric Computing.
|0 http://scigraph.springernature.com/things/product-market-codes/I1701X
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|0 http://scigraph.springernature.com/things/product-market-codes/I17028
|
700 |
1 |
|
|a Nareyek, Alexander.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540428985
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662214336
|
830 |
|
0 |
|a Lecture Notes in Artificial Intelligence ;
|v 2148
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45612-0
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|