Juan A. Carrasco
Orcid: 0000-0001-7757-1651
According to our database1,
Juan A. Carrasco
authored at least 44 papers
between 1989 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
A systematic comparative evaluation of machine learning classifiers and discrete choice models for travel mode choice in the presence of response heterogeneity.
Expert Syst. Appl., 2022
2018
An efficient iterative method for computing deflections of Bernoulli-Euler-von Karman beams on a nonlinear elastic foundation.
Appl. Math. Comput., 2018
2017
Complex., 2017
Implicit ODE solvers with good local error control for the transient analysis of Markov models.
Appl. Math. Comput., 2017
2016
Numer. Algorithms, 2016
2015
Higher order multi-step Jarratt-like method for solving systems of nonlinear equations: Application to PDEs and ODEs.
Comput. Math. Appl., 2015
2014
Reliability Bounds for Fault-Tolerant Systems with Deferred Repair using Bounding Split Regenerative Randomization.
Commun. Stat. Simul. Comput., 2014
2013
A New General-Purpose Method for the Computation of the Interval Availability Distribution.
INFORMS J. Comput., 2013
2011
A Numerical Method for the Evaluation of the Distribution of Cumulative Reward till Exit of a Subset of Transient States of a Markov Reward Model.
IEEE Trans. Dependable Secur. Comput., 2011
An Efficient and Numerically Stable Method for Computing Bounds for the Interval Availability Distribution.
INFORMS J. Comput., 2011
2010
2009
An ROBDD-Based Combinatorial Method for the Evaluation of Yield of Defect-Tolerant Systems-on-Chip.
IEEE Trans. Very Large Scale Integr. Syst., 2009
2008
Tight upper bounds for the expected loss of lexicographic heuristics in binary multi-attribute choice.
Math. Soc. Sci., 2008
Oper. Res., 2008
Corrigendum: "Transient Analysis of Rewarded Continuous Time Markov Models by Regenerative Randomization with Laplace Transform Inversion".
Comput. J., 2008
2007
Corrections on "Failure Transition Distance-Based Importance Sampling Schemes for the Simulation of Repairable Fault-Tolerant Computer Systems" [Jun 06 207-236].
IEEE Trans. Reliab., 2007
2006
Failure Transition Distance-Based Importance Sampling Schemes for theSimulation of Repairable Fault-Tolerant Computer Systems.
IEEE Trans. Reliab., 2006
Two methods for computing bounds for the distribution of cumulative reward for large Markov models.
Perform. Evaluation, 2006
Adapted Importance Sampling Schemes for the Simulation of Dependability Models of Fault-Tolerant Systems with Deferred Repair.
Proceedings of the Proceedings 39th Annual Simulation Symposium (ANSS-39 2006), 2006
2005
Efficient implementations of the randomization method with control of the relative error.
Comput. Oper. Res., 2005
2004
Transient Analysis of Some Rewarded Markov Models Using Randomization with Quasistationarity Detection.
IEEE Trans. Computers, 2004
Combinatorial methods for the evaluation of yield and operational reliability of fault-tolerant systems-on-chip.
Microelectron. Reliab., 2004
Comput. Oper. Res., 2004
2003
Solving dependability/performability irreducible Markov models using regenerative randomization.
IEEE Trans. Reliab., 2003
Computation of bounds for transient measures of large rewarded Markov models using regenerative randomization.
Comput. Oper. Res., 2003
Transient Analysis of Rewarded Continuous Time Markov Models by Regenerative Randomization with Laplace Transform Inversion.
Comput. J., 2003
A Combinatorial Method for the Evaluation of Yield of Fault-Tolerant Systems-on-Chip.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003
Validation of Approximate Dependability Models of a RAID Architecture with Orthogonal Organization.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003
2002
Computationally Efficient and Numerically Stable Reliability Bounds for Repairable Fault-Tolerant Systems.
IEEE Trans. Computers, 2002
2001
A failure-distance based method to bound the reliability of nonrepairable fault-tolerant systems without the knowledge of minimal cuts.
IEEE Trans. Reliab., 2001
2000
Numerical iterative methods for Markovian dependability and performability models: new results and a comparison.
Perform. Evaluation, 2000
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion.
Proceedings of the Parallel and Distributed Processing, 2000
1999
Bounding Steady-State Availability Models with Group Repair and Phase Type Repair Distributions.
Perform. Evaluation, 1999
Failure Distance Based Bounds for Steady-State Availability without the Knowledge of Minimal Cuts.
Proceedings of the MASCOTS 1999, 1999
1998
Perform. Evaluation, 1998
A Comparison of Numerical Splitting-Based Methods for Markovian Dependability and Performability Models.
Proceedings of the Computer Performance Evaluation: Modelling Techniques and Tools, 1998
1997
A Method for the Computation of Reliability Bounds for Non-repairable Fault-tolerant Systems.
Proceedings of the MASCOTS 1997, 1997
1996
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1996
Two New Algorithms to Compute Steady-State Bounds for Markov Models with Slow Forward and Fast Backward Transitions.
Proceedings of the MASCOTS '96, 1996
1995
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1995
Synthesis of I<sub>DDQ</sub>-testable circuits: integrating built-in current sensors.
Proceedings of the 1995 European Design and Test Conference, 1995
1991
Proceedings of the Tenth Symposium on Reliable Distributed Systems, 1991
1989
Automated Construction of Compound Markov Chains from Generalized Stochastic High-Level Petri Nets.
Proceedings of the Third International Workshop on Petri Nets and Performance Models, 1989