Narrow your search

Library

KU Leuven (38)

ULiège (36)

ULB (26)

UCLouvain (23)

Odisee (19)

Thomas More Kempen (18)

Thomas More Mechelen (18)

UCLL (18)

VIVES (18)

KBR (10)

More...

Resource type

book (43)


Language

English (43)


Year
From To Submit

2013 (1)

2012 (2)

2011 (2)

2010 (1)

2009 (3)

More...
Listing 1 - 10 of 43 << page
of 5
>>
Sort by
Algorithm theory : SWAT'96 : 5th Scandinavian workshop on algorithm theory, Reykjavik, Iceland, July 3-5, 1996 : proceedings
Authors: ---
ISBN: 3540614222 9783540614227 Year: 1996 Volume: 1097 Publisher: Berlin [etc.] : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Algorithm theory - SWAT 98. 6th Skandinavian workshop on algorithm theory, Stockholm, Sweden, July 1998. Proceedings
Authors: ---
ISSN: 03029743 ISBN: 3540646825 9783540646822 Year: 1998 Volume: 1432 Publisher: Berlin [etc.] : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity
Authors: ---
ISBN: 0444895434 9786611778910 1281778915 008086791X 9780444895431 9780080867915 9781281778918 Year: 1992 Volume: 51 Publisher: Amsterdam New York North-Holland

Loading...
Export citation

Choose an application

Bookmark

Abstract

Logic, algebra and computation
Author:
ISBN: 3540543155 0387543155 9783540543152 9780387543154 3642768016 3642767990 Year: 1991 Volume: 79 Publisher: Berlin : Springer,

Topics in the theory of computation : selected papers of the International Conference on "Foundations of Computation Theory", FCT '83, Borgholm, Sweden, August 21-27, 1983
Authors: --- --- ---
ISBN: 0444876472 9780444876478 9780080872131 0080872131 1281788201 9786611788209 Year: 1985 Volume: 24 102 Publisher: Amsterdam ; New York : New York, N.Y. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This volume contains nine selected papers presented at the Borgholm conference. They were chosen on the basis of their immediate relevance to the most fundamental aspects of the theory of computation and the newest developments in this area.These papers, which have been extended and refereed, fall into eight categories: 1. Constructive Mathematics in Models of Computation and Programming; 2. Abstract Calculi and Denotational Semantics; 3. Theory of Machines, Computations and Languages; 4. Nondeterminism, Concurrency and Distributed Computing; 5. Abstract Algebras, Logics and Combinator

Boolean function complexity
Author:
ISBN: 1139886363 1107366631 1107371325 1107361729 1107368456 1299404391 1107364175 0511526636 9781107361720 9780511526633 0521408261 9780521408264 Year: 1992 Volume: 169 Publisher: Cambridge ; New York, NY, USA : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.

Complexity, entropy and the physics of information.
Author:
ISBN: 0201515091 0201515067 9780201515060 Year: 1990 Volume: 8 Publisher: S.l. Addison Wesley

Logic and computational complexity : International Workshop LCC'94 Indianapolis, IN, USA, October 13-16, 1994 : selected papers
Authors: ---
ISBN: 3540601783 3540447202 9783540601784 Year: 1995 Volume: 960 Publisher: Berlin ; Heidelberg ; New york Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book contains revised versions of papers invited for presentation at the International Workshop on Logic and Computational Complexity, LCC '94, held in Indianapolis, IN in October 1994. The synergy between logic and computational complexity has gained importance and vigor in recent years, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; they are presented in sections on foundational issues, applicative and proof-theoretic complexity, complexity of proofs, computational complexity of functionals, complexity and model theory, and finite model theory.


Book
EVOLVE - a bridge between probability, set oriented numerics, and evolutionary computation IV : international conference held at Leiden University, July 10-13, 2013

Loading...
Export citation

Choose an application

Bookmark

Abstract

Numerical and computational methods are nowadays used in a wide range of contexts in complex systems research, biology, physics, and engineering.  Over the last decades different methodological schools have emerged with emphasis on different aspects of computation, such as nature-inspired algorithms, set oriented numerics, probabilistic systems and Monte Carlo methods. Due to the use of different terminologies and emphasis on different aspects of algorithmic performance there is a strong need for a more integrated view and opportunities for cross-fertilization across particular disciplines. These proceedings feature 20 original publications from distinguished authors in the cross-section of computational sciences, such as machine learning algorithms and probabilistic models, complex networks and fitness landscape analysis, set oriented numerics and cell mapping, evolutionary multiobjective optimization, diversity-oriented search, and the foundations of genetic programming algorithms. By presenting cutting edge results with a strong focus on foundations and integration aspects this work presents a stepping stone towards efficient, reliable, and well-analyzed methods for complex systems management and analysis.

Listing 1 - 10 of 43 << page
of 5
>>
Sort by