| 2007 |
|---|
| 34 | EE | Montserrat Abril,
Miguel A. Salido,
Federico Barber:
DFS-Tree Based Heuristic Search.
SARA 2007: 5-19 |
| 33 | EE | Miguel A. Salido,
Montserrat Abril,
Federico Barber,
Laura Paola Ingolotti,
Pilar Tormos,
Antonio Luis Lova:
Domain-dependent distributed models for railway scheduling.
Knowl.-Based Syst. 20(2): 186-194 (2007) |
| 2006 |
|---|
| 32 | EE | 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 |
| 31 | EE | Miguel A. Salido,
Federico Barber:
Distributed CSPs by graph partitioning.
Applied Mathematics and Computation 183(1): 491-498 (2006) |
| 2005 |
|---|
| 30 | EE | 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 |
| 29 | EE | Montserrat Abril,
Miguel A. Salido,
Federico Barber:
Distributed Constraints for Large-Scale Scheduling Problems.
CP 2005: 837 |
| 28 | | 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 |
|---|
| 27 | | 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 |
| 26 | EE | Miguel A. Salido,
Federico Barber:
Exploiting the Constrainedness in Constraint Satisfaction Problems.
AIMSA 2004: 126-136 |
| 25 | EE | Antonio Luis Lova,
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 |
| 24 | EE | Miguel A. Salido,
Federico Barber:
Constrainedness and Redundancy by Constraint Ordering.
IBERAMIA 2004: 124-133 |
| 23 | EE | 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 |
| 22 | EE | Maria Isabel Alfonso,
Federico Barber:
A Mixed Closure-CSP Method for Solving Scheduling Problems.
Appl. Intell. 21(2): 173-193 (2004) |
| 2003 |
|---|
| 21 | EE | Miguel A. Salido,
Federico Barber:
Distributed Non-binary Constraints.
CAEPIA 2003: 271-280 |
| 20 | EE | 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 |
| 19 | EE | Federico Barber,
Miguel A. Salido:
Introducción a la programación de restricciones.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 20: 13-30 (2003) |
| 18 | EE | 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) |
| 2002 |
|---|
| 17 | EE | Miguel A. Salido,
Federico Barber:
Disjunction of Non-binary and Numeric Constraint Satisfaction Problems.
CCIA 2002: 159-172 |
| 16 | EE | Miguel A. Salido,
Federico Barber:
Disjunctive and Continuous Constraint Satisfaction Problems.
CP 2002: 768 |
| 15 | EE | Miguel A. Salido,
Adriana Giret,
Federico Barber:
Problemas de Satisfaccion de Restricciones no Binarias con Dominios Continuos.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 15: 60-70 (2002) |
| 2001 |
|---|
| 14 | EE | Miguel A. Salido,
Federico Barber:
An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm.
CP 2001: 779 |
| 13 | EE | Antonio Garrido,
Eva Onaindia,
Federico Barber:
A Temporal Planning System for Time-Optimal Planning.
EPIA 2001: 379-392 |
| 12 | EE | Miguel A. Salido,
Adriana Giret,
Federico Barber:
Realizing a Global Hyperpolyhedron Constraint via LP Techniques.
PuK 2001 |
| 11 | | Antonio Garrido,
Federico Barber:
Integrating Planning and Scheduling.
Applied Artificial Intelligence 15(5): 471-491 (2001) |
| 2000 |
|---|
| 10 | EE | Antonio Garrido,
Miguel A. Salido,
Federico Barber,
M. A. Lopez:
Heuristic Methods for Solving Job-Shop Scheduling Problems.
PuK 2000 |
| 9 | EE | Antonio Garrido,
Miguel A. Salido,
Federico Barber:
Scheduling in a Planning Environment.
PuK 2000 |
| 8 | EE | Federico Barber:
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts.
J. Artif. Intell. Res. (JAIR) 12: 35-86 (2000) |
| 1998 |
|---|
| 7 | | 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 |
| 6 | EE | 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) |
| 1995 |
|---|
| 5 | EE | Vicente J. Botti,
Federico Barber,
Alfons Crespo,
Eva Onaindia,
Ana García-Fornes,
Ismael Ripoll,
D. Gallardo,
L. Hernández:
A Temporal Blackboard for a Multi-Agent Environment.
Data Knowl. Eng. 15(3): 189-211 (1995) |
| 1994 |
|---|
| 4 | | Vicente J. Botti,
Alfons Crespo,
Federico Barber,
Ismael Ripoll:
Multiple Access and Coherence Management in a Real-Time Temporal Blackboard.
ECAI 1994: 312-316 |
| 3 | | 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) |
| 1993 |
|---|
| 2 | | Vicente J. Botti,
Federico Barber,
Alfons Crespo,
D. Gallardo,
Ismael Ripoll,
Eva Onaindia,
L. Hernández:
Sharing Temporal Knowledge by Multiple Agents.
DEXA 1993: 470-473 |
| 1 | | Federico Barber:
A Metric Time-Point and Duration-Based Temporal Model.
SIGART Bulletin 4(3): 30-49 (1993) |
