default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdilson Fernandes de Arruda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Tracey J. England, Paul R. Harper
, Tom Crosby, Daniel Gartner, Edilson F. Arruda, Kieran Foley, Ian Williamson:
Modelling lung cancer diagnostic pathways using discrete event simulation. J. Simulation 17(1): 94-104 (2023)- 2022
- [i4]Edilson F. Arruda, Tarun Sharma, Rodrigo e Alvim Alexandre, Sinnu Susan Thomas:
Epidemic Control Modeling using Parsimonious Models and Markov Decision Processes. CoRR abs/2206.13910 (2022) - 2021
- [i3]Edilson F. Arruda, Dayse H. Pastore, Clauda M. Dias, Shyam S. Das:
Modelling and Optimal Control of Multi Strain Epidemics, with Application to COVID-19. CoRR abs/2101.08137 (2021) - [i2]Edilson F. Arruda, Rodrigo e Alvim Alexandre, Marcelo D. Fragoso, João Bosco Ribeiro do Val, Sinnu Susan Thomas:
A Novel Stochastic Epidemic Model with Application to COVID-19. CoRR abs/2102.08213 (2021) - 2020
- [j14]Henrique L. F. Soares, Edilson F. Arruda, Laura Bahiense, Daniel Gartner, Luiz Amorim Filho:
Optimisation and control of the supply of blood bags in hemotherapic centres via Markov decision process with discounted arrival rate. Artif. Intell. Medicine 104: 101791 (2020) - [j13]Isabelle D. Martins, Laura Bahiense, Carlos E. D. Infante, Edilson F. Arruda:
Dimensionality reduction for multi-criteria problems: An application to the decommissioning of oil and gas installations. Expert Syst. Appl. 148: 113236 (2020) - [j12]Daniel Barry Fuller, Edilson Fernandes de Arruda, Virgílio José Martins Ferreira Filho:
Learning-agent-based simulation for queue network systems. J. Oper. Res. Soc. 71(11): 1723-1739 (2020) - [c10]João Marcelo Leal Gomes Leite, Edilson F. Arruda, Laura Bahiense, Lino G. Marujo:
Mine-to-client planning with Markov Decision Process. ECC 2020: 1123-1128 - [i1]Luís Tarrataca, Clauda M. Dias, Diego Barreto Haddad, Edilson F. Arruda:
Flattening the curves: on-off lock-down strategies for COVID-19 with an application to Brazi. CoRR abs/2004.06916 (2020)
2010 – 2019
- 2019
- [j11]Edilson F. Arruda, Basilio B. Pereira, Clarissa A. Thiers, Bernardo R. Tura:
Optimal testing policies for diagnosing patients with intermediary probability of disease. Artif. Intell. Medicine 97: 89-97 (2019) - [j10]Edilson F. Arruda, Marcelo D. Fragoso, Fabrício Ourique:
A multi-cluster time aggregation approach for Markov chains. Autom. 99: 382-389 (2019) - 2018
- [j9]Daniel Barry Fuller, Virgílio José Martins Ferreira Filho, Edilson Fernandes de Arruda:
Oil industry value chain simulation with learning agents. Comput. Chem. Eng. 111: 199-209 (2018) - [j8]Cecília L. Siqueira, Edilson F. Arruda, Laura Bahiense, Germana L. Bahr, Geraldo R. Motta:
Long-term integrated surgery room optimization and recovery ward planning, with a case study in the Brazilian National Institute of Traumatology and Orthopedics (INTO). Eur. J. Oper. Res. 264(3): 870-883 (2018) - 2017
- [c9]Edilson F. Arruda, Marcelo D. Fragoso, Fabrício Ourique:
Multi-partition time aggregation for Markov Chains. CDC 2017: 4922-4927 - 2016
- [c8]Edilson F. Arruda, Marcelo D. Fragoso:
Discounted Markov decision processes via time aggregation. ECC 2016: 2578-2583 - 2015
- [j7]Edilson Fernandes de Arruda, Marcelo D. Fragoso:
Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm. Eur. J. Oper. Res. 240(3): 697-705 (2015) - 2013
- [j6]Edilson F. Arruda, Fabrício Ourique, Jason Lacombe, Anthony Almudevar:
Accelerating the convergence of value iteration by using partial transition functions. Eur. J. Oper. Res. 229(1): 190-198 (2013) - 2012
- [j5]Tiago Baptista Noronha, Diego von Brixen Montzel Trindade, Vitor Halmenschlager, Maria Cristina Felippetto de Castro, Fernando César Comparsi de Castro, Edilson Fernandes de Arruda:
Window Walker - a Markov-Based Adaptive Bit Window Selection for DSP Blocks. J. Circuits Syst. Comput. 21(4) (2012) - [j4]Anthony Almudevar, Edilson Fernandes de Arruda:
Optimal Approximation Schedules for a Class of Iterative Algorithms, With an Application to Multigrid Value Iteration. IEEE Trans. Autom. Control. 57(12): 3132-3146 (2012) - [c7]Edilson Fernandes de Arruda, Marcelo D. Fragoso:
A two-phase time aggregation algorithm for average cost Markov decision processes. ACC 2012: 1615-1620 - 2011
- [j3]Edilson F. Arruda, Marcelo D. Fragoso, João Bosco Ribeiro do Val:
Approximate dynamic programming via direct search in the space of value function approximations. Eur. J. Oper. Res. 211(2): 343-351 (2011) - [j2]Edilson F. Arruda, Marcelo D. Fragoso:
Time aggregated Markov decision processes via standard dynamic programming. Oper. Res. Lett. 39(3): 193-197 (2011) - 2010
- [c6]Edilson F. Arruda, Fabrício Ourique, Anthony Almudevar:
Toward an optimized value iteration algorithm for average cost Markov decision processes. CDC 2010: 930-934
2000 – 2009
- 2009
- [c5]Edilson F. Arruda, Marcelo D. Fragoso:
Standard dynamic programming applied to time aggregated Markov decision processes. CDC 2009: 2576-2580 - 2008
- [j1]Edilson F. Arruda, João Bosco Ribeiro do Val:
Stability and optimality of a multi-product production and storage system under demand uncertainty. Eur. J. Oper. Res. 188(2): 406-427 (2008) - [c4]Edilson F. Arruda, Marcelo D. Fragoso, João Bosco Ribeiro do Val:
An application of convex optimization concepts to approximate dynamic programming. ACC 2008: 4238-4243 - 2007
- [c3]Anthony Almudevar, Edilson F. Arruda:
Optimal approximation schedules for iterative algorithms with application to dynamic programming. CDC 2007: 4087-4094 - 2006
- [c2]Edilson F. Arruda, João B. R. do Val:
Approximate Dynamic Programming Based on Expansive Projections. CDC 2006: 5537-5542 - 2004
- [c1]Edilson F. Arruda, João B. R. do Val, Anthony Almudevar:
Stability and optimality of a discrete production and storage model with uncertain demand. CDC 2004: 3654-3660
Coauthor Index
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:
