نتایج جستجو برای: engineering demand parameters edp

تعداد نتایج: 957344  

Journal: :Journal of The Knowledge Economy 2022

Smart Specialisation Strategy (S3) research has contributed to better understanding of that policy framework’s conceptual underpinnings but some European regions still find it difficult turn S3 theory into implementation. A key element the implementation challenge concerns enabling or constraining role local institutions on regional development strategies and, more specifically, entrepreneurial...

2005
Anindya Ghose Arun Sundararajan

As Internet-based commerce becomes increasingly widespread, large data sets about the demand for and pricing of a wide variety of products become available. These present exciting new opportunities for empirical economic and business research, but also raise new statistical issues and challenges. In this article, we summarize research that aims to assess the optimality of price discrimination i...

Journal: :Arteriosclerosis, thrombosis, and vascular biology 2014
Charlotte Kawecki Nathalie Hézard Olivier Bocquet Gaël Poitevin Fanja Rabenoelina Alexandre Kauskot Laurent Duca Sébastien Blaise Béatrice Romier Laurent Martiny Philippe Nguyen Laurent Debelle Pascal Maurice

OBJECTIVE Elastin is the major structural extracellular matrix component of the arterial wall that provides the elastic recoil properties and resilience essential for proper vascular function. Elastin-derived peptides (EDP) originating from elastin fragmentation during vascular remodeling have been shown to play an important role in cell physiology and development of cardiovascular diseases. Ho...

Journal: :Mathematical Programming 2022

Since 1997 there has been a steady stream of advances for the maximum disjoint paths problem. Achieving tractable results usually required focusing on relaxations such as: (i) to allow some bounded edge congestion in solutions, (ii) only consider unit weight (cardinality) setting, (iii) require fractional routability selected demands (the all-or-nothing flow setting). For general form (no conge...

2005
Julia Chuzhoy Sanjeev Khanna

In the edge-disjoint paths (EDP) problem, we are given a graph G and a set of source-sink pairs in G. The goal is connect as many pairs as possible in an edge-disjoint manner. This problem is NP-hard and the best known approximation algorithm gives an Õ(min{n2/3,√m})-approximation for both directed and undirected graphs; here n and m denote the number of vertices and edges in G respectively. Fo...

Journal: :International Journal on Innovations in Online Education 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید