نتایج جستجو برای: shortest path with resource constraints

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

Journal: :journal of paramedical sciences 0
kamal mirzaie badrabadi department of computer engineering, maybod branch, islamic azad university, maybod, iran mehdi mirzaie department of computational biology, faculty of high technologies, tarbiat modares university, tehran, iran

protein structural flexibility is important for catalysis, binding, protein design, and allostery. some simple methods have recently been introduced to compute protein flexibility directly from the protein structure without any mechanical models. for example the atomic mean square displacement (or b-factor) is related to the number of neighboring atoms. the protein structure can be modeled as a...

2000
Thomas Schiex Annick Moisan Pierre Rouzé

In this paper, we describe the basis of EuGène, a gene finder for eucaryotic organisms applied to Arabidopsis thaliana. The specificity of EuGène, compared to existing gene finding software, is that EuGène has been designed to combine the output of several information sources, including output of other software or user information. To achieve this, a weighted directed acyclic graph (DAG) is bui...

2012
Mousumi Dutt Arindam Biswas Partha Bhowmick Bhargab B. Bhattacharya

Shortest path algorithms are finding interesting applications in recent times in various emerging areas of image analysis and computer vision. Such algorithms are designed to solve shortest path problems with variegated need-based constraints. We present here an efficient combinatorial algorithm to find a/the shortest isothetic path (SIP) between two grid points in a digital object such that th...

Journal: :Transportation Science 2021

We consider the shortest path problem with resource constraints arising as a subproblem in state-of-the-art branch-cut-and-price algorithms for vehicle routing problems. propose variant of bidirectional label-correcting algorithm which labels are stored and extended according to so-called bucket graph. This organization helps significantly decrease number dominance checks running time algorithm...

2003
Gang Cheng Nirwan Ansari

Finding a feasible path subject to multiple constraints in a network is an NP-complete problem and has been extensively studied. Many proposed source routing algorithms tackle this problem by transforming it into the shortest path selection problem, which is P-complete, with an integrated cost function that maps the multi-constraints of each link into a single cost. However, how to select an ap...

Journal: :international journal of advanced design and manufacturing technology 0
m. vahdati a.r. vahdati

recently, incremental sheet metal forming (ismf) process as one of the new methods in rapid prototyping collection has been considered by researchers. this process is based on a defined path in cnc controller and applies a spherical-head tool that supplies the required pressure for sheet metal forming. despite affirmation of process ability in forming symmetric geometries, some of its aspects s...

Journal: :international journal of automotive engineering 0
azadi taherkhani

this paper develops an automatic parking algorithm based on a fuzzy logic controller with the vehicle pose for the input and the steering angle for the output. in this way some feasible reference trajectory path have been introduced according to geometric and kinematic constraints and nonholonomic constraints to simulate motion path of car. also a novel method is used for parking space detectio...

2006
Zhenjiang Li

Multi-constrained path (MCP) selection, in which the key objective is to search for feasible paths satisfying multiple routing constraints simultaneously, is known to be an NP-Complete problem. Multi-constrained path optimization (MCPO) is different from MCP mainly in that, the feasible paths selected should also be optimal with regard to an optimization metric, which makes path computation in ...

2001
M Dave

Quality of service (QoS) routing is the process of selecting the path to be used by the packets of a flow based on its QoS requirements and the resource availability of the network. In this paper, a new algorithm for pre computation of k constrained QoS routes is proposed and its performance is evaluated. QoS routing relies on state information specifying resource availability at network nodes ...

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

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