default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Barber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[c49]Giancarlo Nicolò, Sergio Ferrer, Miguel A. Salido, Adriana Giret, Federico Barber:
A Multi-Agent Framework to Solve Energy-Aware Unrelated Parallel Machine Scheduling Problems with Machine-Dependent Energy Consumption and Sequence-Dependent Setup Time. ICAPS 2019: 301-309- 2018
- [c48]Daniel Morillo
, Federico Barber, Miguel A. Salido:
Chromosome Mutation vs. Gene Mutation in Evolutive Approaches for Solving the Resource-Constrained Project Scheduling Problem (RCPSP). IEA/AIE 2018: 601-612 - [c47]Sergio Ferrer, Giancarlo Nicolò, Miguel A. Salido, Adriana Giret, Federico Barber:
Dynamic Rescheduling in Energy-Aware Unrelated Parallel Machine Problems. APMS (2) 2018: 232-240 - 2017
- [j32]Federico Barber:
20 aniversario de 'INTELIGENCIA ARTIFICIAL'. Inteligencia Artif. 20(59): 1-4 (2017) - 2016
- [j31]Laura Climent, Miguel A. Salido, Richard J. Wallace, Federico Barber:
Uncertainty in dynamic constraint satisfaction problems. AI Commun. 29(1): 239-241 (2016) - [j30]Miguel A. Salido, Joan Escamilla, Federico Barber, Adriana Giret, Dunbing Tang, Min Dai:
Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems. Artif. Intell. Eng. Des. Anal. Manuf. 30(3): 300-312 (2016) - [j29]Joan Escamilla, Miguel A. Salido, Adriana Giret, Federico Barber:
A metaheuristic technique for energy-efficiency in job-shop scheduling. Knowl. Eng. Rev. 31(5): 475-485 (2016) - [i3]José Francisco García Cantos, Manuel Peinado, Miguel A. Salido, Federico Barber:
Optimisation System for Cutting Continuous Flat Glass. ERCIM News 2016(107) (2016) - 2015
- [j28]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings. Artif. Intell. Rev. 44(2): 131-156 (2015) - [j27]Federico Barber, Miguel A. Salido:
Robustness, stability, recoverability, and reliability in constraint satisfaction problems. Knowl. Inf. Syst. 44(3): 719-734 (2015) - 2014
- [j26]Daniel Morillo, Federico Barber, Miguel A. Salido:
PSPLIB-ENERGY: a extension of PSPLIB library to assess the energy optimization in the RCPSP. Inteligencia Artif. 17(54): 48-61 (2014) - [j25]Mario Rodríguez-Molins, Miguel A. Salido, Federico Barber:
A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds. Appl. Intell. 40(2): 273-290 (2014) - [j24]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Robustness and Stability in Constraint Programming under Dynamism and Uncertainty. J. Artif. Intell. Res. 49: 49-78 (2014) - [j23]Mario Rodríguez-Molins, Laura Paola Ingolotti, Federico Barber, Miguel A. Salido, María R. Sierra, Jorge Puente:
A genetic algorithm for robust berth allocation and quay crane assignment. Prog. Artif. Intell. 2(4): 177-192 (2014) - [c46]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Robustness and Stability in Constraint Programming under Dynamism and Uncertainty - (Extended Abstract). CP 2014: 923-927 - 2013
- [c45]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Modeling Robustness in CSPs as Weighted CSPs. CPAIOR 2013: 44-60 - 2012
- [j22]Mario Rodríguez-Molins, Miguel A. Salido, Federico Barber:
Intelligent planning for allocating containers in maritime terminals. Expert Syst. Appl. 39(1): 978-989 (2012) - [j21]Miguel A. Salido, Federico Barber, Laura Paola Ingolotti:
Robustness for a single railway line: Analytical and simulation methods. Expert Syst. Appl. 39(18): 13305-13327 (2012) - [j20]Miguel A. Salido, Mario Rodríguez-Molins, Federico Barber:
A decision support system for managing combinatorial problems in container terminals. Knowl. Based Syst. 29: 63-74 (2012) - [c44]Mario Rodríguez-Molins, Federico Barber, María R. Sierra, Jorge Puente, Miguel A. Salido:
A Genetic Algorithm for Berth Allocation and Quay Crane Assignment. IBERAMIA 2012: 601-610 - [c43]Joan Escamilla, Mario Rodríguez-Molins, Miguel A. Salido, María R. Sierra, Carlos Mencía, Federico Barber:
Robust Solutions to Job-Shop Scheduling Problems with Operators. ICTAI 2012: 299-306 - [c42]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
An Algorithm for Finding Robust and Stable Solutions for Constraint Satisfaction Problems with Discrete and Ordered Domains. ICTAI 2012: 874-879 - 2011
- [j19]Miguel A. Salido, Mario Rodríguez-Molins, Federico Barber:
Integrated intelligent techniques for remarshaling and berthing in maritime terminals. Adv. Eng. Informatics 25(3): 435-451 (2011) - [c41]Laura Climent, Miguel A. Salido, Federico Barber:
Reformulating Dynamic Linear Constraint Satisfaction Problems as Weighted CSPs for Searching Robust Solutions. SARA 2011 - [i2]Federico Barber:
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts. CoRR abs/1105.6124 (2011) - 2010
- [j18]Montserrat Abril, Miguel A. Salido, Federico Barber:
Nogood-FC for solving partitionable constraint satisfaction problems. J. Intell. Manuf. 21(1): 101-110 (2010) - [c40]Marlene Arangú, Miguel A. Salido, Federico Barber:
AC2001-OP: An Arc-Consistency Algorithm for Constraint Satisfaction Problems. IEA/AIE (3) 2010: 219-228 - [c39]Mario Rodríguez-Molins, Miguel A. Salido, Federico Barber:
Domain-Dependent Planning Heuristics for Locating Containers in Maritime Terminals. IEA/AIE (1) 2010: 742-751 - [c38]Laura Climent, Miguel A. Salido, Federico Barber:
Robust Solutions in Changing Constraint Satisfaction Problems. IEA/AIE (1) 2010: 752-761 - [c37]Miguel A. Salido, Mario Rodríguez-Molins, Federico Barber:
Artificial Intelligence Techniques for the Berth Allocation and Container Stacking Problems in Container Terminals. SGAI Conf. 2010: 295-308
2000 – 2009
- 2009
- [j17]Beatriz López, Víctor Muñoz, Javier Murillo, Federico Barber, Miguel A. Salido, Montserrat Abril, Mariamar Cervantes, Luis F. Caro, Mateu Villaret:
Experimental analysis of optimization techniques on the road passenger transportation problem. Eng. Appl. Artif. Intell. 22(3): 374-388 (2009) - [c36]Marlene Arangú, Miguel A. Salido, Federico Barber:
AC3-OP: An Arc-Consistency Algorithm for Arithmetic Constraints. CCIA 2009: 293-300 - [c35]Laura Climent, Miguel A. Salido, Federico Barber:
Stability of Solutions in Constraint Satisfaction Problems. CCIA 2009: 301-309 - [c34]Miguel A. Salido, Óscar Sapena, Federico Barber:
An Artificial Intelligence Planning Tool for the Container Stacking Problem. ETFA 2009: 1-4 - [c33]Marlene Arangú, Miguel A. Salido, Federico Barber:
2-C3OP: An Improved Version of 2-Consistency. ICTAI 2009: 344-348 - [c32]Miguel A. Salido, Óscar Sapena, Mario Rodríguez-Molins, Federico Barber:
A Planning Tool for Minimizing Reshuffles in Container Terminals. ICTAI 2009: 567-571 - [c31]Marlene Arangú, Miguel A. Salido, Federico Barber:
2-C3: From Arc-Consistency to 2-Consistency. SARA 2009 - [c30]Marlene Arangú, Miguel A. Salido, Federico Barber:
Extending arc-consistency algorithms for Non-Normalized CSPs. SGAI Conf. 2009: 311-316 - [p2]Federico Barber, Laura Paola Ingolotti, Antonio Luis Lova, María Pilar Tormos, Miguel A. Salido:
Meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetabling. Robust and Online Large-Scale Optimization 2009: 145-181 - 2008
- [j16]Montserrat Abril, Miguel A. Salido, Federico Barber:
Distributed search in railway scheduling problems. Eng. Appl. Artif. Intell. 21(5): 744-755 (2008) - [c29]Mariamar Cervantes, Antonio Luis Lova, María Pilar Tormos, Federico Barber:
A Dynamic Population Steady-State Genetic Algorithm for the Resource-Constrained Project Scheduling Problem. IEA/AIE 2008: 611-620 - [p1]María Pilar Tormos, Antonio Luis Lova, Federico Barber, Laura Paola Ingolotti, Montserrat Abril, Miguel A. Salido:
A Genetic Algorithm for Railway Scheduling Problems. Metaheuristics for Scheduling in Industrial and Manufacturing Applications 2008: 255-276 - 2007
- [j15]Federico Barber:
Editorial: 10th anniversary of Artificial Intelligence, Iberoamerican AI Journal. Inteligencia Artif. 11(33) (2007) - [j14]Miguel A. Salido, Montserrat Abril, Federico Barber, Laura Paola Ingolotti, María Pilar Tormos, Antonio Luis Lova:
Domain-dependent distributed models for railway scheduling. Knowl. Based Syst. 20(2): 186-194 (2007) - [c28]Montserrat Abril, Miguel A. Salido, Federico Barber:
DFS-Tree Based Heuristic Search. SARA 2007: 5-19 - [i1]Antonio Luis Lova, María Pilar Tormos, Federico Barber:
OPTIHPER: A Computer-Based Decision Support System for Employee Timetabling Problems. ERCIM News 2007(70) (2007) - 2006
- [j13]Antonio Luis Lova, María Pilar Tormos, Federico Barber:
Multi-mode resource constrained project scheduling: scheduling schemes, priority rules and mode selection rules. Inteligencia Artif. 10(30): 69-86 (2006) - [j12]Lawrence Mandow, Federico Barber:
Editorial 30. Inteligencia Artif. 10(30) (2006) - [j11]Miguel A. Salido, Federico Barber:
Distributed CSPs by graph partitioning. Appl. Math. Comput. 183(1): 491-498 (2006) - [c27]Laura Paola Ingolotti, Antonio Luis Lova, Federico Barber, María Pilar Tormos, Miguel A. Salido, Montserrat Abril:
New Heuristics to Solve the "CSOP" Railway Timetabling Problem. IEA/AIE 2006: 400-409 - [c26]M. A. Salidol, Montserrat Abril, Federico Barber, Laura Paola Ingolotti, María Pilar Tormos, Antonio Luis Lova:
Domain Dependent Distributed Models for Railway Scheduling. SGAI Conf. (Applications) 2006: 163-176 - 2005
- [c25]Laura Paola Ingolotti, Federico Barber, María Pilar Tormos, Antonio Luis Lova, Miguel A. Salido, Montserrat Abril:
A Scheduling Order-Based Method to Solve Timetabling Problems. CAEPIA 2005: 52-61 - [c24]Montserrat Abril, Miguel A. Salido, Federico Barber, Laura Paola Ingolotti, Antonio Luis Lova, María Pilar Tormos:
A Heuristic Technique for the Capacity Assessment of Periodic Trains. CCIA 2005: 339-346 - [c23]Montserrat Abril, Miguel A. Salido, Federico Barber:
Distributed Constraints for Large-Scale Scheduling Problems. CP 2005: 837 - [c22]Miguel A. Salido, Montserrat Abril, Federico Barber, Laura Paola Ingolotti, Antonio Luis Lova, María Pilar Tormos:
Optimization in railway scheduling. ICINCO 2005: 188-195 - 2004
- [j10]María Isabel Alfonso, Federico Barber:
A Mixed Closure-CSP Method for Solving Scheduling Problems. Appl. Intell. 21(2): 173-193 (2004) - [c21]Miguel A. Salido, Federico Barber:
Exploiting the Constrainedness in Constraint Satisfaction Problems. AIMSA 2004: 126-136 - [c20]Antonio Luis Lova, María Pilar Tormos, Federico Barber, Laura Paola Ingolotti, Miguel A. Salido, Montserrat Abril:
Intelligent Train Scheduling on a High-Loaded Railway Network. ATMOS 2004: 219-232 - [c19]Miguel A. Salido, Federico Barber:
Constrainedness and Redundancy by Constraint Ordering. IBERAMIA 2004: 124-133 - [c18]Laura Paola Ingolotti, Federico Barber, María Pilar Tormos, Antonio Luis Lova, Miguel A. Salido, Montserrat Abril:
An Efficient Method to Schedule New Trains on a Heavily Loaded Railway Network. IBERAMIA 2004: 164-173 - [c17]Laura Paola Ingolotti, María Pilar Tormos, Antonio Luis Lova, Federico Barber, Miguel A. Salido, Montserrat Abril:
A Decision Support System (DSS) for the Railway Scheduling Problem. AIAI 2004: 465-474 - [c16]Miguel A. Salido, Federico Barber:
A Non-Binary Constraint Ordering Approach to Scheduling Problems. SGAI Conf. (Applications) 2004: 81-94 - [c15]Miguel A. Salido, Federico Barber, Montserrat Abril, Pilar Tormos, Antonio Luis Lova, Laura Paola Ingolotti:
A Topological Model Based on Railway Capacity to Manage Periodic Train Scheduling. SGAI Conf. (Applications) 2004: 107-120 - 2003
- [j9]Federico Barber, Miguel A. Salido:
Introducción a la programación de restricciones. Inteligencia Artif. 7(20): 13-30 (2003) - [j8]Miguel A. Salido, Federico Barber:
A polynomial algorithm for continuous non-binary disjunctive CSPs: extended DLRs. Knowl. Based Syst. 16(5-6): 277-285 (2003) - [c14]Miguel A. Salido, Federico Barber:
Distributed Non-binary Constraints. CAEPIA 2003: 271-280 - [c13]Federico Barber, Miguel A. Salido, Laura Paola Ingolotti, Montserrat Abril, Antonio Luis Lova, María Pilar Tormos:
An Interactive Train Scheduling Tool for Solving and Plotting Running Maps. CAEPIA 2003: 646-655 - [c12]Miguel A. Salido, Federico Barber:
How to Classify Hard and Soft Constraints in Non-binary Constraint Satisfaction Problems. SGAI Conf. 2003: 213-226 - 2002
- [j7]Miguel A. Salido, Adriana Giret, Federico Barber:
Problemas de Satisfaccion de Restricciones no Binarias con Dominios Continuos. Inteligencia Artif. 6(15): 60-70 (2002) - [c11]Miguel A. Salido, Federico Barber:
Disjunction of Non-binary and Numeric Constraint Satisfaction Problems. CCIA 2002: 159-172 - [c10]Miguel A. Salido, Federico Barber:
Disjunctive and Continuous Constraint Satisfaction Problems. CP 2002: 768 - 2001
- [j6]Antonio Garrido Tejero, Federico Barber:
Integrating Planning and Scheduling. Appl. Artif. Intell. 15(5): 471-491 (2001) - [c9]Miguel A. Salido, Federico Barber:
An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm. CP 2001: 779 - [c8]Antonio Garrido Tejero, Eva Onaindia, Federico Barber:
A Temporal Planning System for Time-Optimal Planning. EPIA 2001: 379-392 - [c7]Miguel A. Salido, Adriana Giret, Federico Barber:
Realizing a Global Hyperpolyhedron Constraint via LP Techniques. PuK 2001 - 2000
- [j5]Federico Barber:
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts. J. Artif. Intell. Res. 12: 35-86 (2000) - [c6]Antonio Garrido Tejero, Miguel A. Salido, Federico Barber:
Scheduling in a Planning Environment. PuK 2000 - [c5]Antonio Garrido Tejero, Miguel A. Salido, Federico Barber, Montserrat Abril López:
Heuristic Methods for Solving Job-Shop Scheduling Problems. PuK 2000
1990 – 1999
- 1998
- [j4]Vicente J. Botti, Federico Barber, Alfons Crespo:
Towards a Temporal Coherence Management in Real-Time Knowledge-Based Systems. Data Knowl. Eng. 25(3): 247-266 (1998) - [c4]Eva Onaindia, Federico Barber, Vicente J. Botti, Carlos Carrascosa, Miguel A. Hernandez, Miguel Rebollo:
A Progressive Heuristic Search Algorithm for the Cutting Stock Problem. IEA/AIE (Vol. 2) 1998: 25-35 - 1995
- [j3]Vicente J. Botti, Federico Barber, Alfons Crespo, Eva Onaindia, Ana García-Fornes, Ismael Ripoll, Domingo Gallardo, Luis Hernández:
A Temporal Blackboard for a Multi-Agent Environment. Data Knowl. Eng. 15(3): 189-211 (1995) - 1994
- [j2]Federico Barber, Vicente J. Botti, Eva Onaindia, Alfons Crespo:
Temporal Reasoning in REAKT: An Environment for Real-Time Knowledge-Based Systems. AI Commun. 7(3/4): 175-202 (1994) - [c3]Federico Barber, Vicent J. Botti, Eva Onaindia:
Temporal Data Representation and Reasoning in REAKT. AIRTC 1994: 347-352 - [c2]Vicente J. Botti, Alfons Crespo, Federico Barber, Ismael Ripoll:
Multiple Access and Coherence Management in a Real-Time Temporal Blackboard. ECAI 1994: 312-316 - 1993
- [j1]Federico Barber:
A Metric Time-Point and Duration-Based Temporal Model. SIGART Bull. 4(3): 30-49 (1993) - [c1]Vicente J. Botti, Federico Barber, Alfons Crespo, Domingo Gallardo, Ismael Ripoll, Eva Onaindia, Luis Hernández:
Sharing Temporal Knowledge by Multiple Agents. DEXA 1993: 470-473
Coauthor Index
Montserrat Abril
aka: Montserrat Abril López
aka: Montserrat Abril López
[c49] [c48] [c47] [j31] [j30] [j29] [i3] [j28] [j27] [j26] [j25] [j24] [j23] [c46] [c45] [j22] [j21] [j20] [c44] [c43] [c42] [j19] [c41] [j18] [c40] [c39] [c38] [c37] [j17] [c36] [c35] [c34] [c33] [c32] [c31] [c30] [p2] [j16] [p1] [j14] [c28] [j11] [c27] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [j9] [j8] [c14] [c13] [c12] [j7] [c11] [c10] [c9] [c7] [c6] [c5]
María Pilar Tormos
aka: Pilar Tormos
aka: Pilar Tormos
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).
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).
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 
.
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.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
