نتایج جستجو برای: hold relax

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

Journal: :Nepal Medical College journal : NMCJ 2014
S Rayamajhi P Dhakshinamoorthy R Raghuveer D Khanal

The concept of stretching is to increase the range of motion of a joint. Theoretical evidence suggests that the in vivo properties of tendon are different between men and women. There exist gender differences in the viscoelastic properties of a tendon too. This suggests that stretching affects the properties of a muscle and because male and female tendons have different viscoelastic properties,...

Journal: :Discrete Mathematics & Theoretical Computer Science 2022

Recently, a conjecture due to Hendry was disproved which stated that every Hamiltonian chordal graph is cycle extendible. Here we further explore the conjecture, showing it fails hold even when number of extra conditions are imposed. In particular, show Hendry's Conjecture for strongly graphs, graphs with high connectivity, and if relax definition "cycle extendible" considerably. We also consid...

2014
Mohammad Sadnan Al Manir Christopher J. O. Baker

In April 2013, the International Consortium of Investigative Journalists (ICIJ) exposed the details of 130,000 offshore accounts. Although there are legitimate businesses which use such accounts, there exist a number of accounts which are possibly linked to international tax fraud and money laundering. The ICIJ investigation was based on 2.5 million records of offshore holdings linked to 170 co...

Journal: :Neural computation 2012
Elisa Benedetti Marco Budinich

We propose a new self-organizing algorithm for a feedforward network inspired to an electrostatic problem that turns out to have intimate relations with information maximization.

2005
Ying Xiao Krishnaiyan Thulasiraman Guoliang Xue Alpár Jüttner

The constrained shortest path (CSP) problem requires the determination of a minimum cost s-t path with delay at most a nonzero integer T. In this paper, we first point out the equivalence of certain algorithms, simply called the LARAC (Lagrangian Relaxation Based Aggregated Cost) algorithm presented independently in some earlier works. The LARAC algorithm solves the integer relaxation of the CS...

Journal: :JACC: Basic to Translational Science 2021

2013
Henrik Björklund Wim Martens Thomas Schwentick

We prove that various containment and validity problems for tree pattern queries with respect to a schema are EXPTIME-complete. When one does not require the root of a tree pattern query to match the root of a tree, validity of a non-branching tree pattern query with respect to a Relax NG schema or W3C XML Schema is already EXPTIME-hard when the query does not branch and uses only child axes. T...

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

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