Listing 1 - 10 of 20 | << page >> |
Sort by
|
Choose an application
This book focuses on recent research in modern optimization and its implications in control and data analysis. This book is a collection of papers from the conference “Optimization and Its Applications in Control and Data Science” dedicated to Professor Boris T. Polyak, which was held in Moscow, Russia on May 13-15, 2015. This book reflects developments in theory and applications rooted by Professor Polyak’s fundamental contributions to constrained and unconstrained optimization, differentiable and nonsmooth functions, control theory and approximation. Each paper focuses on techniques for solving complex optimization problems in different application areas and recent developments in optimization theory and methods. Open problems in optimization, game theory and control theory are included in this collection which will interest engineers and researchers working with efficient algorithms and software for solving optimization problems in market and data analysis. Theoreticians in operations research, applied mathematics, algorithm design, artificial intelligence, machine learning, and software engineering will find this book useful and graduate students will find the state-of-the-art research valuable.
Mathematics. --- Data structures (Computer science). --- Dynamics. --- Ergodic theory. --- System theory. --- Computer science --- Computer mathematics. --- Algorithms. --- Mathematical optimization. --- Optimization. --- Data Structures. --- Systems Theory, Control. --- Dynamical Systems and Ergodic Theory. --- Mathematical Applications in Computer Science. --- Science --- Technology --- Data processing. --- Electronic data processing --- Data structures (Computer scienc. --- Systems theory. --- Differentiable dynamical systems. --- Differential dynamical systems --- Dynamical systems, Differentiable --- Dynamics, Differentiable --- Differential equations --- Global analysis (Mathematics) --- Topological dynamics --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Algorism --- Algebra --- Arithmetic --- Foundations --- Computer science—Mathematics. --- Computer mathematics --- Mathematics --- Dynamical systems --- Kinetics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics --- Systems, Theory of --- Systems science --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Ergodic transformations --- Continuous groups --- Mathematical physics --- Measure theory --- Transformations (Mathematics) --- Philosophy --- Polyak, Boris T. --- Data structures (Computer science)
Choose an application
This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: · Algorithmic aspects of problems with disjoint cycles in graphs · Graphs where maximal cliques and stable sets intersect · The maximum independent set problem with special classes · A general technique for heuristic algorithms for optimization problems · The network design problem with cut constraints · Algorithms for computing the frustration index of a signed graph · A heuristic approach for studying the patrol problem on a graph · Minimum possible sum and product of the proper connection number · Structural and algorithmic results on branchings in digraphs · Improved upper bounds for Korkel--Ghosh benchmark SPLP instances.
Graph theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems --- Mathematical optimization. --- Business logistics. --- Combinatorics. --- Algorithms. --- Optimization. --- Logistics. --- Graph Theory. --- Supply chain management --- Industrial management --- Logistics --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Algorism --- Algebra --- Arithmetic --- Combinatorics --- Foundations
Choose an application
This book focuses on recent research in modern optimization and its implications in control and data analysis. This book is a collection of papers from the conference “Optimization and Its Applications in Control and Data Science” dedicated to Professor Boris T. Polyak, which was held in Moscow, Russia on May 13-15, 2015. This book reflects developments in theory and applications rooted by Professor Polyak’s fundamental contributions to constrained and unconstrained optimization, differentiable and nonsmooth functions, control theory and approximation. Each paper focuses on techniques for solving complex optimization problems in different application areas and recent developments in optimization theory and methods. Open problems in optimization, game theory and control theory are included in this collection which will interest engineers and researchers working with efficient algorithms and software for solving optimization problems in market and data analysis. Theoreticians in operations research, applied mathematics, algorithm design, artificial intelligence, machine learning, and software engineering will find this book useful and graduate students will find the state-of-the-art research valuable.
Ergodic theory. Information theory --- Numerical methods of optimisation --- Operational research. Game theory --- Mathematics --- Classical mechanics. Field theory --- Engineering sciences. Technology --- Computer science --- Computer. Automation --- machine learning --- automatisering --- computers --- informatica --- externe fixatie (geneeskunde --- systeemtheorie --- database management --- wiskunde --- programmatielogica --- algoritmen --- systeembeheer --- dynamica --- informatietheorie
Choose an application
This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: · Algorithmic aspects of problems with disjoint cycles in graphs · Graphs where maximal cliques and stable sets intersect · The maximum independent set problem with special classes · A general technique for heuristic algorithms for optimization problems · The network design problem with cut constraints · Algorithms for computing the frustration index of a signed graph · A heuristic approach for studying the patrol problem on a graph · Minimum possible sum and product of the proper connection number · Structural and algorithmic results on branchings in digraphs · Improved upper bounds for Korkel--Ghosh benchmark SPLP instances.
Statistical science --- Numerical methods of optimisation --- Operational research. Game theory --- Discrete mathematics --- Mathematical statistics --- Physical distribution --- Business management --- Computer science --- Computer. Automation --- grafieken --- intern transport --- discrete wiskunde --- big data --- automatisering --- statistiek --- wiskunde --- algoritmen --- logistiek
Choose an application
Choose an application
Choose an application
Choose an application
Operational research. Game theory --- Discrete mathematics --- Mathematical statistics --- Planning (firm) --- Business management --- Information systems --- Artificial intelligence. Robotics. Simulation. Graphics --- datamining --- discrete wiskunde --- management --- mathematische modellen --- econometrie --- AI (artificiële intelligentie) --- operationeel onderzoek --- data acquisition
Choose an application
Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.
Mathematical optimization. --- Combinatorial analysis --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Combinatorial analysis. --- Algorithms. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Algorism --- Combinatorics --- Mathematics. --- Data structures (Computer science). --- Graph theory. --- Graph Theory. --- Optimization. --- Data Structures. --- Algorithm Analysis and Problem Complexity. --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Arithmetic --- Foundations --- Data structures (Computer scienc. --- Computer software. --- Software, Computer --- Computer systems --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Topology --- Extremal problems
Choose an application
The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin’s ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures—first of all, clusters, orderings, and hierarchies—in multivariate and/or network data. This volume contains a collection of papers reflecting recent developments rooted in Mirkin's fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining, and knowledge discovery. Researchers, students, and software engineers will benefit from new knowledge discovery techniques and application directions.
Computer science --- Data mining --- Mathematics --- Computational complexity. --- Artificial intelligence. --- Mathematical Applications in Computer Science. --- Discrete Mathematics in Computer Science. --- Artificial Intelligence. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Complexity, Computational --- Computer science—Mathematics. --- Computer mathematics. --- Computer mathematics
Listing 1 - 10 of 20 | << page >> |
Sort by
|