Zobrazeno 1 - 10
of 5 144
pro vyhledávání: '"Tomescu A"'
Autor:
Tomescu Ana-Marina
Publikováno v:
Studii si Cercetari Filologice: Seria Limbi Straine Aplicate, Iss 21, Pp 144-155 (2022)
Dans le cadre de cette étude, nous allons insister sur les difficultés auxquelles les étudiants en Langues Modernes Appliquées se heurtent pendant les cours de Langues de spécialité ou de Traductions spécialisées, au moment où ce type de dis
Externí odkaz:
https://doaj.org/article/1ddc7fd179aa4efc8d1075dfad009712
Autor:
Sena, Francisco, Tomescu, Alexandru I.
A common step at the core of many RNA transcript assembly tools is to find a set of weighted paths that best explain the weights of a DAG. While such problems easily become NP-hard, scalable solvers exist only for a basic error-free version of this p
Externí odkaz:
http://arxiv.org/abs/2411.03871
Minimum flow decomposition (MFD) is the strongly NP-hard problem of finding a smallest set of integer weighted paths in a graph $G$ whose weighted sum is equal to a given flow $f$ on $G$. Despite its many practical applications, we lack an understand
Externí odkaz:
http://arxiv.org/abs/2409.20278
Autor:
Tomescu Ana-Marina
Publikováno v:
Studii si Cercetari Filologice: Seria Limbi Straine Aplicate, Iss 18, Pp 138-146 (2019)
L’utilisation des sigles et des acronymes, qui représentent en effet un processus d’abréviation qui a comme point de départ la nécessité d’économie linguistique (graphique et orale), est aujourd'hui un phénomène linguistique d’une rem
Externí odkaz:
https://doaj.org/article/0ef5bdee460048edba4157019eb91688
Autor:
Grigorjew, Andreas, Dias, Fernando H. C., Cracco, Andrea, Rizzi, Romeo, Tomescu, Alexandru I.
Given a flow network, the Minimum Flow Decomposition (MFD) problem is finding the smallest possible set of weighted paths whose superposition equals the flow. It is a classical, strongly NP-hard problem that is proven to be useful in RNA transcript a
Externí odkaz:
http://arxiv.org/abs/2311.10563
Computing a minimum path cover (MPC) of a directed acyclic graph (DAG) is a fundamental problem with a myriad of applications, including reachability. Although it is known how to solve the problem by a simple reduction to minimum flow, recent theoret
Externí odkaz:
http://arxiv.org/abs/2308.08960
Autor:
Tomescu Ada Mirela
Publikováno v:
Annals of the University of Oradea: Economic Science, Vol 24, Iss 2, Pp 175-184 (2014)
At this stage there are numerous studies about how tourism activity is related and affects the environment. The purpose of this paper is to examine theoretically, and to analyse activities that occur in hotels, linking this activity to the principles
Externí odkaz:
https://doaj.org/article/6cc175437094452892ea61705111ea4c
Autor:
Dias, Fernando H. C., Caceres, Manuel, Williams, Lucia, Mumey, Brendan, Tomescu, Alexandru I.
Many important problems in Bioinformatics (e.g., assembly or multi-assembly) admit multiple solutions, while the final objective is to report only one. A common approach to deal with this uncertainty is finding safe partial solutions (e.g., contigs)
Externí odkaz:
http://arxiv.org/abs/2301.13245
Publikováno v:
Studia Universitatis Babeş-Bolyai: Educatio Artis Gymnasticae, Vol 69, Iss 3 (2024)
Structured and purposeful physical activity has demonstrated significant effects on personality traits and behaviors among offenders, especially in reducing maladaptive behaviors. The European Prison Rules strongly advocate for all prisoners to have
Externí odkaz:
https://doaj.org/article/a0a49e866fe94f2a80219cfdd903e7d3
Autor:
Tomescu Ada Mirela
Publikováno v:
Annals of the University of Oradea: Economic Science, Vol 1, Iss 1, Pp 1087-1091 (2012)
The relevance of management as significant factor of business activity can be established on various management systems. These will help to obtain, organise, administrate, evaluate and control particulars: information, quality, environmental protecti
Externí odkaz:
https://doaj.org/article/8ef7292bda2149be92b79619152e5f94