default search action
Lucian Vintan
Person information
- affiliation: "Lucian Blaga" University of Sibiu, Romania
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j13]Arpad Gellert
, Adrian Florea
Performance and energy optimisation in CPUs through fuzzy knowledge representation. Inf. Sci. 476: 375-391 (2019) - 2018
- [j12]Ion Dan Mironescu, Lucian Vintan:
A Simulation Based Analysis of an Multi Objective Diffusive Load Balancing Algorithm. Int. J. Comput. Commun. Control 13(4): 503-520 (2018) - [c16]Ugo Fiore
Optimal Partitioning of LLC in CAT-enabled CPUs to Prevent Side-Channel Attacks. CSS 2018: 115-123 - 2017
- [j11]Lucian N. Vintan, Daniel Morariu
An Extension of the VSM Documents Representation. Int. J. Comput. Commun. Control 12(3): 402-414 (2017) - [c15]Ion Dan Mironescu, Lucian Vintan:
A task scheduling algorithm for HPC applications using colored stochastic Petri Net models. ICCP 2017: 479-486 - 2016
- [j10]Lucian Vintan, Radu Chis, Muhammad Ali Ismail, Cristian Cotofana:
Improving Computing Systems Automatic Multiobjective Optimization Through Meta-Optimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 35(7): 1125-1129 (2016) - 2015
- [j9]Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Ungerer:
Finding near-perfect parameters for hardware and code optimizations with automatic multi-objective design space explorations. Concurr. Comput. Pract. Exp. 27(9): 2196-2214 (2015) - 2013
- [j8]Ciprian Radu, Md. Shahriar Mahbub
Developing Domain-Knowledge Evolutionary Algorithms for Network-on-Chip Application Mapping. Microprocess. Microsystems 37(1): 65-78 (2013) - 2012
- [j7]Arpad Gellert
Multi-objective optimisations for a superscalar architecture with selective value prediction. IET Comput. Digit. Tech. 6(4): 205-213 (2012) - [c14]Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Ungerer:
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge. MMB/DFT 2012: 221-235 - 2011
- [c13]Adrian Florea, Alexandru Ratiu, Arpad Gellert
A Visual Simulation Framework For Simultaneous Multithreading Architectures. ECMS 2011: 403-409 - [c12]Ralf Jahr, Theo Ungerer, Horia Calborean, Lucian Vintan:
Automatic multi-objective optimization of parameters for hardware and code optimizations. HPCS 2011: 308-316 - 2010
- [j6]Daniel Morariu
Improving a SVM Meta-classifier for Text Documents by using Naive Bayes. Int. J. Comput. Commun. Control 5(3): 351-361 (2010) - [c11]Arpad Gellert
Energy-performance design space exploration in SMT architectures exploiting selective load value predictions. DATE 2010: 271-274
2000 – 2009
- 2009
- [j5]Adrian Florea, Arpad Gellert
The Impact of Java Applications at Microarchitectural Level from Branch Prediction Perspective. Int. J. Comput. Commun. Control 4(1): 27-40 (2009) - [j4]Arpad Gellert
Exploiting selective instruction reuse and value prediction in a superscalar architecture. J. Syst. Archit. 55(3): 188-195 (2009) - 2008
- [j3]Daniel Morariu, Maria N. Vintan, Lucian Vintan:
Studying SVM Method's Scalability Using Text Documents. Scalable Comput. Pract. Exp. 9(1) (2008) - 2007
- [c10]Arpad Gellert
Unbiased Branches: An Open Problem. Asia-Pacific Computer Systems Architecture Conference 2007: 16-27 - [c9]Michael F. P. O'Boyle, François Bodin, José González, Lucian N. Vintan:
Topic 4 High-Performance Architectures and Compilers. Euro-Par 2007: 235 - [c8]Daniel Morariu
Aspects Concerning SVM Method's Scalability. IDC 2007: 125-134 - 2006
- [c7]Lucian N. Vintan, Arpad Gellert
Understanding Prediction Limits Through Unbiased Branches. Asia-Pacific Computer Systems Architecture Conference 2006: 480-487 - 2003
- [j2]Colin Egan, Gordon B. Steven, Patrick Quick, Rubén Anguera, Fleur L. Steven, Lucian N. Vintan:
Two-level branch prediction using neural networks. J. Syst. Archit. 49(12-15): 557-570 (2003) - [j1]Lucian N. Vintan, Marius Sbera, Ioan Z. Mihu, Adrian Florea:
An alternative to branch prediction: pre-computed branches. SIGARCH Comput. Archit. News 31(3): 20-29 (2003) - 2002
- [c6]Colin Egan, Gordon B. Steven, Lucian N. Vintan:
Cached Two-Level Adaptive Branch Predictors with Multiple Stages. ARCS 2002: 179-194 - 2001
- [c5]Gordon B. Steven, Rubén Anguera, Colin Egan, Fleur L. Steven, Lucian N. Vintan:
Dynamic Branch Prediction Using Neural Networks. DSD 2001: 178-185 - [c4]Colin Egan, Gordon B. Steven, Won Shim, Lucian N. Vintan:
Applying Caching to Two-Level Adaptive Branch Prediction. DSD 2001: 186-193
1990 – 1999
- 1999
- [c3]Lucian N. Vintan, Colin Egan:
Extending Correlation in Branch Prediction Schemes. EUROMICRO 1999: 1441-1448 - [c2]Lucian N. Vintan, Mihaela Iridon:
Towards a high performance neural branch predictor. IJCNN 1999: 868-873 - [c1]Lucian N. Vintan, Cristian Armat, Gordon B. Steven:
The impact of cache organisation on the instruction issue rate of a superscalar processor. PDP 1999: 58-65
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-04-25 05:54 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: