| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Basdogan, C., Lum, M.J.H., Salcedo, J., Chow, E., Kupiec, S.A. & Kostrewski, A. | Autostereoscopic and Haptic Visualization for Space Exploration and Mission Design. [BibTeX] |
2002 | Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems, pp. 271-276 | inproceedings | URL |
BibTeX:
@inproceedings{conf/haptics/BasdoganLSCKK02,
author = {Cagatay Basdogan and Mitchell J. H. Lum and Jose Salcedo and Edward Chow and Stephen A. Kupiec and Andrew Kostrewski},
title = {Autostereoscopic and Haptic Visualization for Space Exploration and Mission Design.},
booktitle = {Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems},
year = {2002},
pages = {271-276},
url = {http://dblp.uni-trier.de/db/conf/haptics/haptics2002.html#BasdoganLSCKK02}
}
|
|||||
| Guerra-Salcedo, C. & Whitley, D. | Genetic Approach to Feature Selection for Ensemble Creation | 1999 | Vol. 1Proceedings of the Genetic and Evolutionary Computation Conference, pp. 236-243 |
inproceedings | URL |
| Abstract: boosting and bagging | |||||
BibTeX:
@inproceedings{guerra-salcedo:1999:GAFSEC,
author = {Cesar Guerra-Salcedo and Darrell Whitley},
title = {Genetic Approach to Feature Selection for Ensemble Creation},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference},
publisher = {Morgan Kaufmann},
year = {1999},
volume = {1},
pages = {236--243},
url = {http://www.cs.colostate.edu/~genitor/1999/gecco99c.pdf}
}
|
|||||
| Guerra-Salcedo, C. & Whitley, D. | Genetic Search for Feature Subset Selection: A Comparison Between CHC and GENESIS [BibTeX] |
1998 | Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 504-509 | inproceedings | |
BibTeX:
@inproceedings{guerra-salcedo:1998:gsfss,
author = {Cesar Guerra-Salcedo and Darrell Whitley},
title = {Genetic Search for Feature Subset Selection: A Comparison Between CHC and GENESIS},
booktitle = {Genetic Programming 1998: Proceedings of the Third Annual Conference},
publisher = {Morgan Kaufmann},
year = {1998},
pages = {504--509}
}
|
|||||
| Moreno, R.P. & Salcedo, J.L.V. | Evaluation of Sequential Function Charts execution techniques. The Active Steps Algorithm. [BibTeX] |
2008 | ETFA, pp. 74-81 | inproceedings | URL |
BibTeX:
@inproceedings{conf/etfa/MorenoS08,
author = {Ramon Piedrafita Moreno and José Luis Villarroel Salcedo},
title = {Evaluation of Sequential Function Charts execution techniques. The Active Steps Algorithm.},
booktitle = {ETFA},
publisher = {IEEE},
year = {2008},
pages = {74-81},
url = {http://dblp.uni-trier.de/db/conf/etfa/etfa2008.html#MorenoS08}
}
|
|||||
| Salcedo, J.V. & Martínez, M. | Design of PDC fuzzy controllers under persistent disturbances and application in mechanical systems. [BibTeX] |
2008 | Advances in Engineering Software Vol. 39(11), pp. 937-946 |
article | URL |
BibTeX:
@article{journals/aes/SalcedoM08,
author = {J. V. Salcedo and M. Martínez},
title = {Design of PDC fuzzy controllers under persistent disturbances and application in mechanical systems.},
journal = {Advances in Engineering Software},
year = {2008},
volume = {39},
number = {11},
pages = {937-946},
url = {http://dblp.uni-trier.de/db/journals/aes/aes39.html#SalcedoM08}
}
|
|||||
| Salcedo, M. | Faculty and the 21st century student in USA higher education. [BibTeX] |
2003 | SIGCSE Bulletin Vol. 35(2), pp. 83-87 |
article | URL |
BibTeX:
@article{journals/sigcse/Salcedo03,
author = {Michaelangelo Salcedo},
title = {Faculty and the 21st century student in USA higher education.},
journal = {SIGCSE Bulletin},
year = {2003},
volume = {35},
number = {2},
pages = {83-87},
url = {http://dblp.uni-trier.de/db/journals/sigcse/sigcse35.html#Salcedo03}
}
|
|||||
| Salcedo, M.R. & Decouchant, D. | Structured Cooperative Authoring for the World Wide Web [BibTeX] |
1997 | International Journal of CSCW Special Issue on CSCW and the Web Vol. 6(2-3), pp. 157-174 |
article | |
BibTeX:
@article{Salcedo97,
author = {Manuel Romero Salcedo and Dominique Decouchant},
title = {Structured Cooperative Authoring for the World Wide Web},
journal = {International Journal of CSCW Special Issue on CSCW and the Web},
year = {1997},
volume = {6},
number = {2-3},
pages = {157-174}
}
|
|||||
| Salcedo-Sanz, S. & Bousoño-Calzón, C. | On the application of linear transformations for genetic algorithms optimization. [BibTeX] |
2007 | KES Journal Vol. 11(2), pp. 89-104 |
article | URL |
BibTeX:
@article{journals/kes/Salcedo-SanzB07,
author = {Sancho Salcedo-Sanz and Carlos Bousoño-Calzón},
title = {On the application of linear transformations for genetic algorithms optimization.},
journal = {KES Journal},
year = {2007},
volume = {11},
number = {2},
pages = {89-104},
url = {http://dblp.uni-trier.de/db/journals/kes/kes11.html#Salcedo-SanzB07}
}
|
|||||
| Salcedo-Sanz, S., Fernandez-Villacanas, J., Segovia-Vargas, M.J. & Bousono-Calzon, C. | Genetic programming for the prediction of insolvency in non-life insurance companies | 2005 | Computers & Operations Research Vol. 32(4), pp. 749-765 |
article | DOI URL |
| Abstract: Prediction of non-life insurance companies insolvency has arisen as an important problem in the field of financial research, due to the necessity of protecting the general public whilst minimising the costs associated to this problem, such as the effects on state insurance guaranty funds or the responsibilities for management and auditors. Most methods applied in the past to predict business failure in non-life insurance companies are traditional statistical techniques, which use financial ratios as explicative variables. However, these variables do not usually satisfy statistical assumptions, what complicates the application of the mentioned methods. Emergent statistical learning methods like neural networks or SVMs provide a successful approach in terms of error rate, but their character of black-box methods make the obtained results difficult to be interpreted and discussed. we propose an approach to predict insolvency of non-life insurance companies based on the application of genetic programming (GP). GP is a class of evolutionary algorithms, which operates by codifying the solution of the problem as a population of LISP trees. This type of algorithm provides a diagnosis output in the form of a decision tree with given functions and data. We can treat it like a computer program which returns an answer depending on the input, and, more importantly, the tree can potentially be inspected, interpreted and re-used for different data sets. We have compared the performance of GP with other classifiers approaches, a Support Vector Machine and a Rough Set algorithm. The final purpose is to create an automatic diagnostic system for analysing non-insurance firms using their financial ratios as explicative variables. | |||||
BibTeX:
@article{Salcedo-Sanz:2005:COR,
author = {Sancho Salcedo-Sanz and Jose-Luis Fernandez-Villacanas and Maria Jesus Segovia-Vargas and Carlos Bousono-Calzon},
title = {Genetic programming for the prediction of insolvency in non-life insurance companies},
journal = {Computers & Operations Research},
year = {2005},
volume = {32},
number = {4},
pages = {749--765},
url = {http://www.sciencedirect.com/science/article/B6VC5-49PYKV6-3/2/ea8a7b2d639b4cadb419cb9acf2a1352},
doi = {doi:10.1016/j.cor.2003.08.015}
}
|
|||||
| Salcedo-Sanz, S., Xu, Y. & Yao, X. | Meta-Heuristic Algorithms for FPGA Segmented Channel Routing Problems with Non-standard Cost Functions | 2005 | Genetic Programming and Evolvable Machines Vol. 6(4), pp. 359-379 |
article | DOI |
| Abstract: we present three meta-heuristic approaches for FPGA segmented channel routing problems (FSCRPs) with a new cost function in which the cost of each assignment is not known in advance, and the cost of a solution only can be obtained from entire feasible assignments. Previous approaches to FSCPs cannot be applied to this kind of cost functions, and meta-heuristics are a good option to tackle the problem. We present two hybrid algorithms which use a Hopfield neural network to solve the problem's constraints, mixed with a Genetic Algorithm (GA) and a Simulated Annealing (SA). The third approach is a GA which manages the problem's constraints with a penalty function. We provide a complete analysis of the three metaheuristics, by tested them in several FSCRP instances, and comparing their performance and suitability to solve the FSCRP. | |||||
BibTeX:
@article{Salcedo-Sanz:2005:GPEM,
author = {Sancho Salcedo-Sanz and Yong Xu and Xin Yao},
title = {Meta-Heuristic Algorithms for FPGA Segmented Channel Routing Problems with Non-standard Cost Functions},
journal = {Genetic Programming and Evolvable Machines},
year = {2005},
volume = {6},
number = {4},
pages = {359--379},
doi = {doi:10.1007/s10710-005-3295-z}
}
|
|||||
Created by JabRef on 01/12/2008.