Yago Saez

Ontology type: schema:Person     

Person Info





Publications in SciGraph latest 50 shown

  • 2018-11-09 Model Selection in Committees of Evolved Convolutional Neural Networks Using Genetic Algorithms in INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING – IDEAL 2018
  • 2017-09 Clustering technique for large-scale home care crew scheduling problems in APPLIED INTELLIGENCE
  • 2015 Learning Levels of Mario AI Using Genetic Algorithms in ADVANCES IN ARTIFICIAL INTELLIGENCE
  • 2015 Understanding Auctions in NONE
  • 2011-04 The Clock Proxy Auction for Allocating Radio Spectrum Licenses in COMPUTATIONAL ECONOMICS
  • 2010-07-26 Co-evolutionary Agents in Combinatorial Sealed-bid Auctions for Spectrum Licenses Markets in PROGRESS IN ARTIFICIAL ECONOMICS
  • 2010 Car Setup Optimisation in SIMULATED EVOLUTION AND LEARNING
  • 2009-08-01 Multi-Unit Auction Analysis by Means of Agent-Based Computational Economics in ARTIFICIAL ECONOMICS
  • 2009 The Radio Network Design Optimization Problem in BIOLOGICALLY-INSPIRED OPTIMISATION METHODS
  • 2008-10 Early bankruptcy prediction using ENPC in APPLIED INTELLIGENCE
  • 2008-10 Soft computing techniques applied to finance in APPLIED INTELLIGENCE
  • 2008 Driving Cars by Means of Genetic Algorithms in PARALLEL PROBLEM SOLVING FROM NATURE – PPSN X
  • 2007 Human Mosaic Creation Through Agents and Interactive Genetic Algorithms Applied to Videogames Movements in APPLICATIONS OF EVOLUTINARY COMPUTING
  • 2006 An Experimental Comparative Study for Interactive Evolutionary Computation Problems in APPLICATIONS OF EVOLUTIONARY COMPUTING
  • 2005-06 Reference chromosome to overcome user fatigue in IEC in NEW GENERATION COMPUTING
  • 2005 Interactive Evolutionary Computation algorithms applied to solve Rastrigin test functions in SOFT COMPUTING AS TRANSDISCIPLINARY SCIENCE AND TECHNOLOGY
  • 2005 Genetic Algorithms versus Human Bidding Strategies for Auctions in SOFT COMPUTING AS TRANSDISCIPLINARY SCIENCE AND TECHNOLOGY
  • 2003-04-15 Genetic Algorithms for the Generation of Models with Micropopulations in APPLICATIONS OF EVOLUTIONARY COMPUTING
  • Affiliations

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.7840.b", 
              "type": "Organization"
            "isCurrent": true, 
            "type": "OrganizationRole"
        "familyName": "Saez", 
        "givenName": "Yago", 
        "id": "sg:person.015652275365.31", 
        "identifier": {
          "name": "orcid_id", 
          "type": "PropertyValue", 
          "value": [
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:40", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1455.json", 
        "type": "Person"

    Download the RDF metadata as:  json-ld nt turtle xml License info


    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.015652275365.31'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.015652275365.31'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.015652275365.31'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.015652275365.31'


    Preview window. Press ESC to close (or click here)