Narrow your search

Library

KU Leuven (9)

UCLouvain (9)

UNamur (6)

ULB (5)

ULiège (5)

UGent (4)

VUB (4)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

More...

Resource type

book (9)


Language

English (9)


Year
From To Submit

2008 (1)

2006 (3)

2005 (3)

1998 (1)

1981 (1)

Listing 1 - 9 of 9
Sort by
Stochastic local search : foundations and applications
Authors: ---
ISBN: 9781558608726 1558608729 1493303732 9786611015053 1281015059 0080498248 9780080498249 9781281015051 6611015051 Year: 2005 Publisher: San Francisco: Morgan Kaufmann,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the

Online stochastic combinatorial optimization
Authors: ---
ISBN: 9780262220804 0262220806 9780262513470 0262513471 0262257157 1282096834 1429477741 9780262257152 9781429477741 0262299984 Year: 2006 Publisher: Cambridge (Mass.): MIT Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

"Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge. This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research."--Publisher's website.

Constraint-based local search
Authors: ---
ISBN: 0262220776 9780262513487 9780262220774 Year: 2005 Publisher: Cambridge, Mass.: MIT Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Numerical optimization
Authors: ---
ISBN: 9780387400655 9780387303031 0387303030 Year: 2006 Publisher: New York: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Numerical Optimization presents a comprehensive and up-to-date description of the most effective methods in continuous optimization. It responds to the growing interest in optimization in engineering, science, and business by focusing on the methods that are best suited to practical problems. For this new edition the book has been thoroughly updated throughout. There are new chapters on nonlinear interior methods and derivative-free methods for optimization, both of which are used widely in practice and the focus of much current research. Because of the emphasis on practical methods, as well as the extensive illustrations and exercises, the book is accessible to a wide audience. It can be used as a graduate text in engineering, operations research, mathematics, computer science, and business. It also serves as a handbook for researchers and practitioners in the field. The authors have strived to produce a text that is pleasant to read, informative, and rigorous - one that reveals both the beautiful nature of the discipline and its practical side.

Finite elements and fast iterative solvers with applications in incompressible fluid dynamics
Authors: --- ---
ISBN: 0198528671 019852868X 9780198528685 9780198528678 Year: 2005 Publisher: New York (N.Y.) : Oxford university press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

532 --- 517.9 --- 517.9 Differential equations. Integral equations. Other functional equations. Finite differences. Calculus of variations. Functional analysis --- Differential equations. Integral equations. Other functional equations. Finite differences. Calculus of variations. Functional analysis --- 532 Fluid mechanics in general. Mechanics of liquids (hydromechanics) --- Fluid mechanics in general. Mechanics of liquids (hydromechanics) --- Partitial differential equations: domain decomposition methods elliptic equations finite difference methods finite element methods finite volume methods hyperbolic equations inverse problems iterative solution techniques methods of lines multigrid and multilevel methods parabolic equations special methods --- Numerical linear algebra: conditioning determinants eigenvalues and eigenvectors error analysis linear systems matrix inversion pseudoinverses singular value decomposition sparse, structured, and very large systems (direct and iterative methods) --- Differential equations, Partial --- Finite element method --- Fluid dynamics --- CFD (Computational fluid dynamics) --- FEA (Numerical analysis) --- FEM (Numerical analysis) --- Finite element analysis --- Numerical analysis --- Isogeometric analysis --- Partial differential equations --- Data processing --- Computer simulation --- 519.6 --- 681.3*G13 --- 681.3*G18 --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Numerical linear algebra: conditioning; determinants; eigenvalues and eigenvectors; error analysis; linear systems; matrix inversion; pseudoinverses; singular value decomposition; sparse, structured, and very large systems (direct and iterative methods) --- Partitial differential equations: domain decomposition methods; elliptic equations; finite difference methods; finite element methods; finite volume methods; hyperbolic equations; inverse problems; iterative solution techniques; methods of lines; multigrid and multilevel methods; parabolic equations; special methods --- Differential equations, Partial. --- Finite element method. --- Data processing. --- Computational fluid dynamics. --- Fluides, Dynamique des --- Equations aux dérivées partielles --- Méthode des éléments finis --- Informatique --- Fluid dynamics - Data processing

Abelian varieties with complex multiplication and modular functions
Author:
ISBN: 0691016569 1400883946 9780691016566 Year: 1998 Volume: 46 Publisher: Princeton (N.J.): Princeton university press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Reciprocity laws of various kinds play a central role in number theory. In the easiest case, one obtains a transparent formulation by means of roots of unity, which are special values of exponential functions. A similar theory can be developed for special values of elliptic or elliptic modular functions, and is called complex multiplication of such functions. In 1900 Hilbert proposed the generalization of these as the twelfth of his famous problems. In this book, Goro Shimura provides the most comprehensive generalizations of this type by stating several reciprocity laws in terms of abelian varieties, theta functions, and modular functions of several variables, including Siegel modular functions. This subject is closely connected with the zeta function of an abelian variety, which is also covered as a main theme in the book. The third topic explored by Shimura is the various algebraic relations among the periods of abelian integrals. The investigation of such algebraicity is relatively new, but has attracted the interest of increasingly many researchers. Many of the topics discussed in this book have not been covered before. In particular, this is the first book in which the topics of various algebraic relations among the periods of abelian integrals, as well as the special values of theta and Siegel modular functions, are treated extensively.

Keywords

Ordered algebraic structures --- 512.74 --- Abelian varieties --- Modular functions --- Functions, Modular --- Elliptic functions --- Group theory --- Number theory --- Varieties, Abelian --- Geometry, Algebraic --- Algebraic groups. Abelian varieties --- 512.74 Algebraic groups. Abelian varieties --- Abelian varieties. --- Modular functions. --- Abelian extension. --- Abelian group. --- Abelian variety. --- Absolute value. --- Adele ring. --- Affine space. --- Affine variety. --- Algebraic closure. --- Algebraic equation. --- Algebraic extension. --- Algebraic number field. --- Algebraic structure. --- Algebraic variety. --- Analytic manifold. --- Automorphic function. --- Automorphism. --- Big O notation. --- CM-field. --- Characteristic polynomial. --- Class field theory. --- Coefficient. --- Complete variety. --- Complex conjugate. --- Complex multiplication. --- Complex number. --- Complex torus. --- Corollary. --- Degenerate bilinear form. --- Differential form. --- Direct product. --- Direct proof. --- Discrete valuation ring. --- Divisor. --- Eigenvalues and eigenvectors. --- Embedding. --- Endomorphism. --- Existential quantification. --- Field of fractions. --- Finite field. --- Fractional ideal. --- Function (mathematics). --- Fundamental theorem. --- Galois extension. --- Galois group. --- Galois theory. --- Generic point. --- Ground field. --- Group theory. --- Groupoid. --- Hecke character. --- Homology (mathematics). --- Homomorphism. --- Identity element. --- Integer. --- Irreducibility (mathematics). --- Irreducible representation. --- Lie group. --- Linear combination. --- Linear subspace. --- Local ring. --- Modular form. --- Natural number. --- Number theory. --- Polynomial. --- Prime factor. --- Prime ideal. --- Projective space. --- Projective variety. --- Rational function. --- Rational mapping. --- Rational number. --- Real number. --- Residue field. --- Riemann hypothesis. --- Root of unity. --- Scientific notation. --- Semisimple algebra. --- Simple algebra. --- Singular value. --- Special case. --- Subgroup. --- Subring. --- Subset. --- Summation. --- Theorem. --- Vector space. --- Zero element.

Advances in metaheuristics for hard optimization
Authors: ---
ISBN: 1281139645 9786611139643 3540729607 3540729593 3642092063 9783540729594 Year: 2008 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Many advances have been made recently in metaheuristic methods, from theory to applications. The editors, both leading experts in this field, have assembled a team of researchers to contribute 21 chapters organized into parts on simulated annealing, tabu search, ant colony algorithms, general-purpose studies of evolutionary algorithms, applications of evolutionary algorithms, and various metaheuristics. The book gathers contributions related to the following topics: theoretical developments in metaheuristics; adaptation of discrete metaheuristics to continuous optimization; performance comparisons of metaheuristics; cooperative methods combining different approaches; parallel and distributed metaheuristics for multiobjective optimization; software implementations; and real-world applications. This book is suitable for practitioners, researchers and graduate students in disciplines such as optimization, heuristics, operations research, and natural computing.

Keywords

Mathematical optimization. --- Mathematical optimization --- Heuristic programming --- Engineering & Applied Sciences --- Mechanical Engineering --- Civil & Environmental Engineering --- Computer Science --- Mechanical Engineering - General --- Operations Research --- Heuristic programming. --- Information Technology --- Artificial Intelligence --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematics. --- Computers. --- Artificial intelligence. --- Operations research. --- Management science. --- Engineering design. --- Optimization. --- Artificial Intelligence (incl. Robotics). --- Operations Research, Management Science. --- Engineering Design. --- Theory of Computation. --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Design, Engineering --- Engineering --- Industrial design --- Strains and stresses --- Quantitative business analysis --- Management --- Problem solving --- Statistical decision --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- 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 --- Fifth generation computers --- Neural computers --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Calculators --- Cyberspace --- Math --- Science --- Design --- Artificial intelligence --- Programming (Mathematics) --- Information theory. --- Artificial Intelligence. --- Communication theory --- Communication --- 681.3*G13 --- 681.3*G6 --- Numerical linear algebra: conditioning; determinants; eigenvalues and eigenvectors; error analysis; linear systems; matrix inversion; pseudoinverses; singular value decomposition; sparse, structured, and very large systems (direct and iterative methods) --- Computerwetenschap--?*G6 --- Computer science. --- Operations Research, Management Science . --- Informatics

Listing 1 - 9 of 9
Sort by


Copyright ©2025 SemperTool