Edizione	[1st ed. 2001.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica	1 online resource (X, 310 p.)
Disciplina	519.7
Collana	Lecture Notes in Computer Science
Soggetto topico	Mathematical optimization Computer science—Mathematics Algorithms Information technology Business—Data processing Data structures (Computer science) Combinatorics Optimization Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity IT in Business Data Structures
ISBN	3-540-45586-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms -- Projection and Lifting in Combinatorial Optimization -- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems -- Lagrangian Relaxation -- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS -- Branch, Cut, and Price: Sequential and Parallel -- TSP Cuts Which Do Not Conform to the Template Paradigm.
Record Nr.	UNINA-9910143921303321

Edizione	[1st ed. 2006.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica	1 online resource (XXI, 803 p.)
Disciplina	006.3
Collana	Lecture Notes in Bioinformatics
Soggetto topico	Artificial intelligence Algorithms Data structures (Computer science) Computers Database management Bioinformatics Artificial Intelligence Algorithm Analysis and Problem Complexity Data Structures Computation by Abstract Devices Database Management
ISBN	3-540-37282-2
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Ant Colony Optimisation -- Particle Swarm Optimisation -- Swarm Intelligence -- Autonomy-Oriented Computing -- Quantum and Molecular Computations -- Biological and DNA Computing -- Intelligent Computing in Bioinformatics -- Intelligent Computing in Computational Biology and Drug Design -- Computational Genomics and Proteomics -- Artificial Life and Artificial Immune Systems in Intelligent Computing -- Special Session on Bio-oriented and Bio-inspired Information Systems -- Special Session on Novel Applications of Knowledge Discovery on Bioinformatics.
Record Nr.	UNINA-9910483042103321

Edizione	[1st ed. 2003.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Descrizione fisica	1 online resource (XII, 436 p.)
Disciplina	794.8/1416
Collana	Lecture Notes in Computer Science
Soggetto topico	Computer science Computer science—Mathematics Data structures (Computer science) Algorithms Numerical analysis Mathematical statistics Popular Computer Science Discrete Mathematics in Computer Science Data Structures Algorithm Analysis and Problem Complexity Numeric Computing Probability and Statistics in Computer Science
ISBN	3-540-40031-1
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	1: Evaluation and Learning -- Distinguishing Gamblers from Investors at the Blackjack Table -- MOUSE(?): A Self-teaching Algorithm that Achieved Master-Strength at Othello -- Investigation of an Adaptive Cribbage Player -- Learning a Game Strategy Using Pattern-Weights and Self-play -- 2: Search -- PDS-PN: A New Proof-Number Search Algorithm -- A Generalized Threats Search Algorithm -- Proof-Set Search -- A Comparison of Algorithms for Multi-player Games -- Selective Search in an Amazons Program -- Playing Games with Multiple Choice Systems -- The Neural MoveMap Heuristic in Chess -- Board Maps and Hill-Climbing for Opening and Middle Game Play in Shogi -- 3: Combinatorial Games/Theory -- Solitaire Clobber -- Complexity of Error-Correcting Codes Derived from Combinatorial Games -- Analysis of Composite Corridors -- 4: Opening/Endgame Databases -- New Winning and Losing Positions for 7×7 Hex -- Position-Value Representation in Opening Books -- Indefinite Sequence of Moves in Chinese Chess Endgames -- 5: Commercial Games -- ORTS: A Hack-Free RTS Game Environment -- Causal Normalization: A Methodology for Coherent Story Logic Design in Computer Role-Playing Games -- A Structure for Modern Computer Narratives -- 6: Single-Agent Search/Planning -- Tackling Post’s Correspondence Problem -- Perimeter Search Performance -- Using Abstraction for Planning in Sokoban -- 7: Computer Go -- A Small Go Board Study of Metric and Dimensional Evaluation Functions -- Local Move Prediction in Go -- Evaluating Kos in a Neutral Threat Environment: Preliminary Results.
Record Nr.	UNINA-9910144213003321

Edizione	[1st ed. 2004.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Descrizione fisica	1 online resource (XIV, 482 p.)
Disciplina	005.1
Collana	Lecture Notes in Computer Science
Soggetto topico	Computers Algorithms Computer science—Mathematics Computer communication systems Data structures (Computer science) Coding theory Information theory Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Communication Networks Data Structures Coding and Information Theory
Soggetto non controllato	COCOON Computing Combinatorics
ISBN	3-540-27798-6
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Invited Presentations -- External Geometric Data Structures -- The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems -- Robust Geometric Computation Based on Digital Topology -- Data Structures and Algorithms I -- Adjacency of Optimal Regions for Huffman Trees -- A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs -- Towards Constructing Optimal Strip Move Sequences -- Computational Geometry I -- Large Triangles in the d-Dimensional Unit-Cube -- Progress on Maximum Weight Triangulation -- Coloring Octrees -- Games and Combinatorics -- Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes -- Q-Ary Ulam-Rényi Game with Weighted Constrained Lies -- Necessary and Sufficient Numbers of Cards for the Transformation Protocol -- Combinatorial Optimization I -- On the Selection and Assignment with Minimum Quantity Commitments -- Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study -- Transshipment Through Crossdocks with Inventory and Time Windows -- Graph Algorithms -- Approximated Vertex Cover for Graphs with Perfect Matchings -- An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs -- On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts -- The Worst-Case Time Complexity for Generating All Maximal Cliques -- Automata and Learning Theory -- Regular Expressions for Languages over Infinite Alphabets -- On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations -- Learning DNFs and Circuits Using Teaching Assistants -- On the Complexity of Samples for Learning -- Scheduling -- New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation -- Maximization of the Size and the Weight of Schedules of Degradable Intervals -- Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines -- Computational Geometry II -- Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain -- Algorithms for Point Set Matching with k-Differences -- Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon -- Data Structures and Algorithms II -- The Traveling Salesman Problem with Few Inner Points -- A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application -- Algorithms for the On-Line Quota Traveling Salesman Problem -- Graph Drawing -- On the Orthogonal Drawing of Outerplanar Graphs -- Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs -- New Bounds on the Number of Edges in a k-Map Graph -- Combinatorial Optimization II -- Dynamic Storage Allocation and On-Line Colouring Interval Graphs -- New Approximation Algorithms for Some Dynamic Storage Allocation Problems -- k-Center Problems with Minimum Coverage -- Complexity Theory -- On the Extensions of Solovay-Reducibility -- The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups -- Computational Complexity Classification of Partition under Compaction and Retraction -- Parallel and Distributed Architectures -- One-to-Many Disjoint Path Covers in a Graph with Faulty Elements -- Fault-Tolerant Meshes with Constant Degree -- Fault Hamiltonicity of Meshes with Two Wraparound Edges -- On the Expected Time for Herman’s Probabilistic Self-stabilizing Algorithm -- Computational Biology -- An Efficient Online Algorithm for Square Detection -- An Efficient Local Alignment Algorithm for Masked Sequences -- Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard -- Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets.
Record Nr.	UNISA-996465535403316