نتایج جستجو برای: following distance

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

1998
Jana Koehler

This paper outlines the basic principles underlying reasoning about resources in IPP, which is a classical planner based on planning graphs originally introduced with the graphplan system. The main idea is to deal with resources in a strictly action-centered way, i.e., one speciies how each action consumes or produces resources, but no explicit temporal model is used. This avoids the computatio...

Journal: :Journal of applied physiology 2010
Nicholas Luden Erik Hayes Andrew Galpin Kiril Minchev Bozena Jemiolo Ulrika Raue Todd A Trappe Matthew P Harber Ted Bowers Scott Trappe

The purpose of this study was to examine the effects of a 3-wk taper on the physiology of competitive distance runners. We studied seven collegiate distance runners (20+/-1 yr, 66+/-1 kg) before and after a 3-wk taper. The primary measures included 8-km cross-country race performance, gastrocnemius single muscle fiber size and function (peak force, shortening velocity, and power), baseline and ...

Journal: :J. Comb. Theory, Ser. B 1997
Yuh-jeng Liang Chih-Wen Weng

Let 1=(X, R) denote a distance-regular graph with distance function and diameter d 4. By a parallelogram of length i (2 i d ), we mean a 4-tuple xyzu of vertices in X such that (x, y)= (z, u)=1, (x, u)=i, and (x, z)= ( y, z)= ( y, u)=i&1. We prove the following theorem. Theorem. Let 1 denote a distanceregular graph with diameter d 4, and intersection numbers a1=0, a2 {0. Suppose 1 is Q-polynomi...

Journal: :international journal of smart electrical engineering 2013
soheila gheisari shahram javadi alireza kashaninya

in this paper, a novel patch geodesic derivative pattern (pgdp) describing the texture map of a face through its shape data is proposed. geodesic adjusted textures are encoded into derivative patterns for similarity measurement between two 3d images with different pose and expression variations. an extensive experimental investigation is conducted using the publicly available bosphorus and bu-3...

Journal: :communication in combinatorics and optimization 0
p. dankelmann university of johannesburg

the average distance of a vertex $v$ of a connected graph $g$is the arithmetic mean of the distances from $v$ to allother vertices of $g$. the proximity $pi(g)$ and the remoteness $rho(g)$of $g$ are defined as the minimum and maximum averagedistance of the vertices of $g$. in this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...

The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...

Journal: :International Journal of Modern Physics A 1998

A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.

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

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