Narrow your search

Library

EhB (34)

VUB (29)

KU Leuven (26)

Odisee (26)

Thomas More Kempen (26)

Thomas More Mechelen (26)

UCLL (26)

ULB (26)

ULiège (26)

VIVES (26)

More...

Resource type

book (34)


Language

English (33)

Italian (1)


Year
From To Submit

2012 (1)

2011 (1)

2010 (2)

2009 (2)

2008 (9)

More...
Listing 1 - 10 of 34 << page
of 4
>>
Sort by

Book
Evolutionary Computation in Combinatorial Optimization : 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005. Proceedings
Authors: --- ---
ISBN: 9783540319962 Year: 2005 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

Evolutionary computation (EC) involves the study of problem-solving and op- mization techniques inspired by principles of natural evolution and genetics. EC has been able to draw the attention of an increasing number of researchers and practitioners in several ?elds. Evolutionary algorithms have in particular been showntobee?ectivefordi?cultcombinatorialoptimizationproblemsappearing in various industrial, economics, and scienti?c domains. This volume contains the proceedings of EvoCOP 2005, the 5th European Conference on Evolutionary Computation in Combinatorial Optimization. It was held in Lausanne, Switzerland, on 30 March-1 April 2005, jointly with EuroGP 2005, the 8th European Conference on Genetic Programming, and the EvoWorkshops 2005, which consisted of the following six individual workshops: EvoBIO, the 3rd European Workshop on Evolutionary Bioinformatics; Evo- COMNET, the 2nd European Workshop on Evolutionary Computation in C- munication, Networks, and Connected Systems; EvoHOT, the 2nd European Workshop on Hardware Optimisation Techniques; EvoIASP, the 7th European Workshop on Evolutionary Computation in Image Analysis and Signal Proce- ing; EvoMUSART, the 3rd European Workshop on Evolutionary Music and Art; and EvoSTOC, the 2nd European Workshop on Evolutionary Algorithms in Stochastic and Dynamic Environments.


Book
High Performance Computing for Computational Science - VECPAR 2004 : 6th International Conference, Valencia, Spain, June 28-30, 2004, Revised Selected and Invited Papers
Authors: --- --- --- ---
ISBN: 9783540318545 Year: 2005 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

VECPAR is a series of international conferences dedicated to the promotion and advancement of all aspects of high-performance computing for computational science, as an industrial technique and academic discipline, extending the fr- tier of both the state of the art and the state of practice. The audience for and participants in VECPAR are seen as researchers in academic departments, g- ernment laboratories and industrial organizations. There is now a permanent website for the series, http://vecpar.fe.up.pt, where the history of the conf- ences is described. ThesixtheditionofVECPARwasthe?rsttimetheconferencewascelebrated outside Porto - at the Universitad Politecnica de Valencia (Spain), June 28-30, 2004. The whole conference programme consisted of 6 invited talks, 61 papers and26posters,outof130contributionsthatwereinitiallysubmitted.Themajor themes were divided into large-scale numerical and non-numerical simulations, parallel and grid computing, biosciences, numerical algorithms, data mining and visualization. This postconference book includes the best 48 papers and 5 invited talks presented during the three days of the conference. The book is organized into 6 chapters, with a prominent position reserved for the invited talks and the Best Student Paper. As a whole it appeals to a wide research community, from those involved in the engineering applications to those interested in the actual details of the hardware or software implementations, in line with what, in these days, tends to be considered as computational science and engineering (CSE).


Book
New Computational Paradigms : First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005. Proceedings
Authors: --- --- ---
ISBN: 9783540322665 Year: 2005 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

CiE 2005: New Computational Paradigms http://www. illc. uva. nl/CiE/ ThecooperationComputabilityinEurope (CiE)isaninformalEuropeannetwork covering computability in theoretical computer science and mathematical logic, ranging from application of novel approaches to computation to set-theoretic analysesofin?nitarycomputingmodels. Thecooperationconsistsofelevenmain nodesandincludesover400researchers;itiscoordinatedfromLeeds(UK). More information about CiE can be found in Barry Cooper's introductory paper to this volume (p. 1) and at http://www. amsta. leeds. ac. uk/pure/staff/cooper/cie. html CiE 2005 was a conference on the special topic New Computational Pa- digms  and was held in Amsterdam in June 2005. It was initiated by and served as a focus point for the informal cooperation CiE. The topic of New Com- tational Paradigms  covers connections between computation and physical s- tems (e. g. , quantum computation, neural nets, molecular computation) but also higher mathematical models of computation (e. g. , in?nitary computation or real computation). Computability theory is central to large areas of theoretical computer science and mathematical logic. Traditionally, the computational model of the Turing machine (or mathematically equivalent models) has been used to reason about computation or computability. For general computability inquiries (with - bounded resources), the choice of the model of computation hardly matters (this fact is encapsulated in the so-called Church-Turing thesis ); this could change as soon as questions of e?ciency are investigated.


Book
Algorithms and Data Structures : 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005. Proceedings
Authors: --- --- ---
ISBN: 9783540317111 Year: 2005 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

The papers in this volume were presented at the 9th Workshop on Algorithms and Data Structures (WADS 2005). The workshop took place during August 15 - 17, 2005, at the University of Waterloo, Waterloo, Canada. The workshop alternateswith the ScandinavianWorkshopon Algorithm Theory(SWAT), c- tinuing the traditionof SWAT and WADS startingwith SWAT 1988and WADS 1989. From 90 submissions, the Program Committee selected 37 papers for p- sentation at the workshop. In addition, invited lectures were given by the f- lowing distinguished researchers: Allan Borodin and Max J. Egenhofer. OnbehalfoftheProgramCommittee,wewouldliketoexpressoursincere- preciation to the many persons whose e?ort contributed to making WADS 2005 a success. These include the invited speakers,members of the ste- ing and ProgramCommittees, the authors who submitted papers, and the many referees who assisted the ProgramCommittee. We are indebted to Robert Kane forinstallingandmodifyingthesubmissionsoftware,maintainingthesubmission server and interacting with authors as well as for helping with the preparation of the program. August 2005 Frank Dehne, Alejandro Lop ´ ez-Ortiz, and Jorg-R ¨ u ¨diger Sack WADS Organization Organizing Institutions Steering Committee Frank Dehne Carleton University, Canada Ian Munro University of Waterloo, Canada J¨ org-Rudig ¨ er Sack Carleton University, Canada Roberto Tamassia Brown University, Canada Program Co-chairs Frank Dehne Carleton University, Canada Alejandro Lop ´ ez-Ortiz University of Waterloo, Canada J¨ org-Rudig ¨ er Sack Carleton University, Canada Conference Chair Alejandro Lop ´ ez-Ortiz University of Waterloo, Canada Program Committee Pankaj Agarwal Duke University, USA Michael Atkinson University of Otago, New Zealand Gill Barequet Technion, Israel Mark de Berg Tech.


Book
Formal Methods in Software and Systems Modeling : Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday
Authors: --- --- --- --- --- et al.
ISBN: 9783540318477 Year: 2005 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

By presenting state-of-the-art research results on various aspects of formal and visual modeling of software and systems, this book commemorates the 60th birthday of Hartmut Ehrig. The 24 invited reviewed papers are written by students and collaborators of Hartmut Ehrig who are established researchers in their fields. Reflecting the scientific interest and work of Hartmut Ehrig, the papers fall into three main parts on graph transformation, algebraic specification and logic, and formal and visual modeling.


Book
Algebra and Coalgebra in Computer Science : First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005. Proceedings
Authors: --- --- --- ---
ISBN: 9783540318767 Year: 2005 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

In April 2004, after one year of intense debate, CMCS, the International Workshop on Coalgebraic Methods in Computer Science, and WADT, the Workshop on Al- braic Development Techniques, decided to join their forces and reputations into a new high-level biennial conference. CALCO, the Conference on Algebra and Co- gebra in Computer Science, was created to bring together researchers and practit- ners to exchange new results related to foundational aspects, and both traditional and emerging uses of algebras and coalgebras in computer science. A steering committee was put together by merging those of CMCS and WADT: Jiri Adamek, Ataru Na- gawa, Michel Bidoit, José Fiadeiro (co-chair), Hans-Peter Gumm, Bart Jacobs, Hans- Jörg Kreowski, Ugo Montanari, Larry Moss, Peter Mosses, Fernando Orejas, Fr- cesco Parisi-Presicce, John Power, Horst Reichel, Markus Roggenbach, Jan Rutten (co-chair), and Andrzej Tarlecki. CALCO 2005 was the first instance of this new conference. The interest that it generated in the scientific community suggests that it will not be the last. Indeed, it attracted as many as 62 submissions covering a wide range of topics roughly divided into two areas: Algebras and Coalgebras as Mathematical Objects: Automata and languages; categorical semantics; hybrid, probabilistic, and timed systems; inductive and co- ductive methods; modal logics; relational systems and term rewriting.


Book
Graph Drawing : 12th International Symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004, Revised Selected Papers
Authors: ---
ISBN: 9783540318439 Year: 2005 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

The 12th International Symposium on Graph Drawing (GD 2004)was held d- ing September 29-October 2, 2004, at City College, CUNY, in the heart of Harlem, New York City. GD 2004 attracted 94 participants from 19 countries. In response to the call for papers, the program committee received 86 re- larsubmissionsdescribingoriginalresearchand/orsystemdemonstrations.Each submissionwasreviewedbyatleastthreeprogramcommitteemembersandc- ments were returned to the authors. Following extensive e-mail discussions, the program committee accepted 39 long papers (11 pages each in the proceedings) and 12 short papers (6 pages each). In addition, 4 posters were displayed and discussed in the conference exhibition room (2 pages each in the proceedings). Theprogramcommittee ofGD 2004invitedtwo distinguishedlecturers.P- fessorPaulSeymourfromPrincetonUniversitypresenteda newcharacterization ofclaw-freegraphs(jointworkwithMariaChudnovsky).ProfessorErikDemaine from MIT reported on his joint work with Fedor Fomin, MohammadTaghi - jiaghayi and Dimitrios Thilikos, concerning fast (often subexponential) ?x- parameter algorithms and polynomial approximation schemes for broad classes of NP-hard problems in topological graph theory. A survey of the subject by Professors Demaine and Hajiaghayi is included in this volume. As usual, the annual graph drawing contest was held during the conference. This time the contest had two distinct tracks: the graph drawing challenge and the freestyle contest. A report is included in the proceedings.


Book
Building bridges : between mathematics and computer science
Authors: ---
ISBN: 9783540852216 3540852182 9783540852186 9786612824197 3540852212 1282824198 Year: 2008 Publisher: New York, N.Y. : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovász’s 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers.

Keywords

Mathematics. --- Combinatorics. --- Number Theory. --- Numeric Computing. --- Discrete Mathematics in Computer Science. --- Electronic data processing. --- Computational complexity. --- Number theory. --- Mathématiques --- Informatique --- Complexité de calcul (Informatique) --- Théorie des nombres --- Combinatorial analysis -- Congresses. --- Computer science -- Mathematics -- Congresses. --- Lovász, László, 1948-. --- Mathematics --- Algebra --- Physical Sciences & Mathematics --- Computer science --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Computers. --- Numerical analysis. --- Discrete mathematics. --- Discrete Mathematics. --- Theory of Computation. --- Information theory. --- Complexity, Computational --- Machine theory --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Number study --- Numbers, Theory of --- Communication theory --- Communication --- Cybernetics --- Combinatorics --- Mathematical analysis --- Automation --- Computer science—Mathematics. --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Calculators --- Cyberspace --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Computer science. --- Numerical Analysis. --- Informatics --- Science

Relaxation and decomposition methods for mixed integer nonlinear programming
Author:
ISBN: 128060882X 9786610608829 3764373741 0817672389 3764372389 9780817672386 9783764372385 9783764373740 Year: 2005 Volume: 152 Publisher: Boston, MA: Birkhäuser,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). The main focus is on deterministic global optimization methods, which play a very important role in integer linear programming, and are used only recently in MINLP. The presented material consists of two parts. The first part describes basic optimization tools, such as block-separable reformulations, convex and Lagrangian relaxations, decomposition methods and global optimality criteria. Some of these results are presented here for the first time. The second part is devoted to algorithms. Starting with a short overview on existing methods, deformation, rounding, partitioning and Lagrangian heuristics, and a branch-cut-and-price algorithm are presented. The algorithms are implemented as part of an object-oriented library, called LaGO. Numerical results on several mixed integer nonlinear programs are reported to show abilities and limits of the proposed solution methods. The book contains many illustrations and an up-to-date bibliography. Because of the emphasis on practical methods, as well as the introduction into the basic theory, it is accessible to a wide audience and can be used both as a research as well as a graduate text.

Handbook of mathematical models in computer vision
Authors: --- ---
ISBN: 1280612185 9786610612185 0387288317 0387263713 1441938850 9780387263717 9780387288314 Year: 2006 Publisher: New York: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Visual perception refers to the ability of understanding the visual information that is provided by the environment. Such a mechanism integrates several human abilities and was studied by many researchers with different scientific origins including philosophy, physiology, biology, neurobiology, mathematics and engineering. In particular in the recent years an effort to understand, formalize and finally reproduce mechanical visual perception systems able to see and understand the environment using computational theories was made by mathematicians, statisticians and engineers. Such a task connects visual tasks with optimization processes and the answer to the visual perception task corresponds to the lowest potential of a task-driven objective function. In this edited volume we present the most prominent mathematical models that are considered in computational vision. To this end, tasks of increasing complexity are considered and we present the state-of-the-art methods to cope with such tasks. The volume consists of six thematic areas that provide answers to the most dominant questions of computational vision: Image reconstruction, Segmentation and object extraction, Shape modeling and registration, Motion analysis and tracking, 3D from images, geometry and reconstruction Applications in medical image analysis.

Listing 1 - 10 of 34 << page
of 4
>>
Sort by