liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Algorithms for the Maximum Hamming Distance Problem
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
2006 (English)In: Recent Advances in Constraints: Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers / [ed] Boi V. Faltings, Adrian Petcu, François Fages and Francesca Rossi, Springer Berlin/Heidelberg, 2006, 128-141 p.Chapter in book (Refereed)
Abstract [en]

This book constitutes the thoroughly refereed and extended post-proceedings of the Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, held in Uppsala, Sweden in June 2005.

Besides papers taken from the workshop, others are submitted in response to an open call for papers after the workshop.

The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on global constraints, search and heuristics, language and implementation issues, and modeling.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2006. 128-141 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 3419
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3419
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-31032DOI: 10.1007/11402763_10Local ID: 16737ISBN: 978-3-540-25176-7 (print)ISBN: e-978-3-540-32252-8 ISBN: 3-540-25176-6 (print)OAI: oai:DiVA.org:liu-31032DiVA: diva2:251855
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2013-10-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textfind book at a swedish library/hitta boken i ett svenskt biblioteklink

Authority records BETA

Angelsmark, OlaThapper, Johan

Search in DiVA

By author/editor
Angelsmark, OlaThapper, Johan
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of TechnologyApplied Mathematics
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 438 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf