default search action
Vural Aksakalli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j22]Tabinda Sarwar
, Sattar Seifollahi, Jeffrey Chan
The Secondary Use of Electronic Health Records for Data Mining: Data Characteristics and Challenges. ACM Comput. Surv. 55(2): 33:1-33:40 (2023) - 2021
- [j21]Ali Fuat Alkaya, Serkan Yildirim, Vural Aksakalli:
Heuristics for the Canadian traveler problem with neutralizations. Comput. Ind. Eng. 159: 107488 (2021) - [j20]Vural Aksakalli, Zeren D. Yenice, Milad Malekipirbazari
Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains. Comput. Oper. Res. 132: 105334 (2021) - [j19]Milad Malekipirbazari
Performance comparison of feature selection and extraction methods with random instance selection. Expert Syst. Appl. 179: 115072 (2021) - [j18]Guo Feng Anders Yeo, Vural Aksakalli:
A stochastic approximation approach to simultaneous feature weighting and selection for nearest neighbour learners. Expert Syst. Appl. 185: 115671 (2021) - [j17]Carl E. Belle
A machine learning platform for the discovery of materials. J. Cheminformatics 13(1): 42 (2021) - 2020
- [j16]Bahman Madadi
A stochastic approximation approach to spatio-temporal anchorage planning with multiple objectives. Expert Syst. Appl. 146: 113170 (2020) - [j15]Mani Suleiman, Haydar Demirhan, Leanne Boyd, Federico Girosi
Incorporation of expert knowledge in the statistical detection of diagnosis related group misclassification. Int. J. Medical Informatics 136: 104086 (2020) - [j14]Mani Suleiman, Haydar Demirhan, Leanne Boyd, Federico Girosi
A clinical coding recommender system. Knowl. Based Syst. 210: 106455 (2020)
2010 – 2019
- 2019
- [j13]Serkan Yildirim, Vural Aksakalli
Canadian Traveler Problem with Neutralizations. Expert Syst. Appl. 132: 151-165 (2019) - [c8]Ufuk Aslan, Ali Fuat Alkaya, Serkan Yildirim, Vural Aksakalli:
Any Angle Path Finding in Stochastic Obstacle Scenes. ICAAI 2019: 122-126 - 2018
- [c7]Ramazan Algin, Ali Fuat Alkaya, Vural Aksakalli:
Hybridization of Migrating Birds Optimization with Simulated Annealing. HIS 2018: 189-197 - [i4]Zeren D. Yenice, Niranjan Adhikari, Yong Kai Wong, Vural Aksakalli, Alev Taskin Gumus, Babak Abbasi:
SPSA-FSR: Simultaneous Perturbation Stochastic Approximation for Feature Selection and Ranking. CoRR abs/1804.05589 (2018) - 2016
- [j12]Vural Aksakalli, O. Furkan Sahin, Ibrahim Ari
An AO* Based Exact Algorithm for the Canadian Traveler Problem. INFORMS J. Comput. 28(1): 96-111 (2016) - [j11]Daniel Damir Harabor, Alban Grastien, Dindar Öz, Vural Aksakalli:
Optimal Any-Angle Pathfinding In Practice. J. Artif. Intell. Res. 56: 89-118 (2016) - [j10]Vural Aksakalli
Feature selection via binary simultaneous perturbation stochastic approximation. Pattern Recognit. Lett. 75: 41-47 (2016) - 2015
- [j9]Ali Fuat Alkaya, Vural Aksakalli, Carey E. Priebe:
A penalty search algorithm for the obstacle neutralization problem. Comput. Oper. Res. 53: 165-175 (2015) - [j8]Dindar Öz
An anchorage planning strategy with safety and utilization considerations. Comput. Oper. Res. 62: 12-22 (2015) - [j7]Milad Malekipirbazari
Risk assessment in social lending via random forests. Expert Syst. Appl. 42(10): 4621-4631 (2015) - [c6]Milad Malekipirbazari
Capacity Planning in Non-uniform Depth Anchorages. KES-IDT 2015: 21-30 - [i3]Ramazan Algin, Ali Fuat Alkaya, Vural Aksakalli:
Performance Comparison of Metaheuristics for the Obstacle Neutralization Problem. CTW 2015: 24-27 - [i2]Dindar Öz, Ali Fuat Alkaya, Vural Aksakalli:
Developing an Exact Method for the Obstacle Neutralization Problem. CTW 2015: 254-257 - [i1]Vural Aksakalli, Milad Malekipirbazari:
Feature Selection via Binary Simultaneous Perturbation Stochastic Approximation. CoRR abs/1508.07630 (2015) - 2014
- [j6]Melih Bulu
Algorithm-embedded IT applications for an emerging knowledge city: Istanbul, Turkey. Expert Syst. Appl. 41(12): 5625-5635 (2014) - [j5]Vural Aksakalli, Ibrahim Ari
Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem. INFORMS J. Comput. 26(2): 370-384 (2014) - [c5]Ali Fuat Alkaya, Ramazan Algin, Yusuf Sahin, Mustafa Agaoglu, Vural Aksakalli:
Performance of Migrating Birds Optimization Algorithm on Continuous Functions. ICSI (2) 2014: 452-459 - 2013
- [j4]Ibrahim Ari
Optimal ship navigation with safety distance and realistic turn constraints. Eur. J. Oper. Res. 229(3): 707-717 (2013) - [c4]Ramazan Algin, Ali Fuat Alkaya, Vural Aksakalli, Dindar Öz:
An Ant System Algorithm for the Neutralization Problem. IWANN (2) 2013: 53-61 - 2012
- [j3]Vural Aksakalli:
Optimizing direct response in Internet display advertising. Electron. Commer. Res. Appl. 11(3): 229-240 (2012) - [c3]Tarik Arici, Vural Aksakalli:
Energy-minimization based Motion Estimation using Adaptive Smoothness Priors. VISAPP (2) 2012: 201-207
2000 – 2009
- 2007
- [j2]Donniell E. Fishkind, Carey E. Priebe, Kendall E. Giles, L. N. Smith, Vural Aksakalli:
Disambiguation Protocols Based on Risk Simulation. IEEE Trans. Syst. Man Cybern. Part A 37(5): 814-823 (2007) - [c2]Vural Aksakalli:
The BAO* algorithm for stochastic shortest path problems with dynamic learning. CDC 2007: 6003-6008 - 2006
- [c1]Vural Aksakalli, Daniel Ursu:
Control of Nonlinear Stochastic Systems: Model-Free Controllers versus Linear Quadratic Regulators. CDC 2006: 4145-4150 - 2004
- [j1]Yahya Fathi
Heuristic methods for gang-rip saw arbor design. Eur. J. Oper. Res. 154(3): 626-640 (2004)
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-05-08 21:03 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: