The Knowledge Engineering Review, Volume 25 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > The Knowledge Engineering Review

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 25, Number 1, March 2010

Articles

• 
  • 
  • 
  • 
  • 
    James R. Foulds, Eibe Frank:
    A review of multi-instance learning assumptions. 1-25
• 
  • 
  • 
  • 
  • 
    Zoran Bosnic, Igor Kononenko:
    Automatic selection of reliability estimates for individual regression predictions. 27-47
• 
  • 
  • 
  • 
  • 
    Sumana Sharma, Kweku-Muata Osei-Bryson:
    Toward an integrated knowledge discovery and data mining process model. 49-67
• 
  • 
  • 
  • 
  • 
    Wei Pang, George Macleod Coghill:
    Learning Qualitative Differential Equation models: a survey of algorithms and applications. 69-107

Book Review

• 
  • 
  • 
  • 
  • 
    Simon Parsons:
    Stuck in the Shallow End: Education, Race and Computing by Margolis Jane with Estrella Rachel, Goode Joanna, Holme Jennifer Jellison and Nao Kimberley, MIT Press, 216 pp., ISBN 0262-13504-7. 109-110

Volume 25, Number 2, June 2010

Volume 25, Number 3, September 2010

• 
  • 
  • 
  • 
  • 
    Roman Barták, Amedeo Cesta, Lee McCluskey, Miguel A. Salido:
    Preface to special issue on planning and scheduling. 247-248
• 
  • 
  • 
  • 
  • 
    Roman Barták, Miguel A. Salido, Francesca Rossi:
    New trends in constraint satisfaction, planning, and scheduling: a survey. 249-279
• 
  • 
  • 
  • 
  • 
    Lukás Chrpa:
    Generation of macro-operators via investigation of action dependencies in plans. 281-297
• 
  • 
  • 
  • 
  • 
    Amedeo Cesta, Alberto Finzi, Simone Fratini, Andrea Orlandini, Enrico Tronci:
    Validation and verification issues in a timeline-based planning system. 299-318
• 
  • 
  • 
  • 
  • 
    Gérard Verfaillie, Cédric Pralet, Michel Lemaître:
    How to model planning and scheduling problems using constraint networks on timelines. 319-336
• 
  • 
  • 
  • 
  • 
    Neil Yorke-Smith, Hung Hai Bui:
    Efficient variable elimination for semi-structured simple temporal networks with continuous domains. 337-351

Book Review

• 
  • 
  • 
  • 
  • 
    Simon Parsons:
    Introduction to Machine Learning, Second Editon by Ethem Alpaydin, MIT Press, 584 pp., ISBN 978-0-262-01243-0. 353
• 
  • 
  • 
  • 
  • 
    Simon Parsons:
    Critical Play: Radical Game Design by Mary Flanagan, MIT Press, 353 pp., ISBN 978-0-262-06268-8. 353-354
• 
  • 
  • 
  • 
  • 
    Simon Parsons:
    New Tech, New Ties: How mobile communication is reshaping social cohesion by Rich Ling, MIT Press, 224 pp., ISBN 978-0-262-12297-9, Play Between Worlds: Exploring online game culture by T. L. Taylor, MIT Press, 197 pp., ISBN 978-0-262-51262-6 and_Communities of Play: Emergent cultures in multiplayer games and virtual worlds_ by Celia Pearce and Artemesia, MIT Press, 327 pp., ISBN 978-0-262-16257-9. 355-357

Volume 25, Number 4, December 2010

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: