Titlebook: Computing in the 90‘s; The First Great Lake Naveed A. Sherwani,Elise Doncker,John A. Kapenga Conference proceedings 1991 Springer-Verlag Be

Holter-monitor

书目名称Computing in the 90‘s影响因子(影响力)




书目名称Computing in the 90‘s影响因子(影响力)学科排名




书目名称Computing in the 90‘s网络公开度




书目名称Computing in the 90‘s网络公开度学科排名




书目名称Computing in the 90‘s被引频次




书目名称Computing in the 90‘s被引频次学科排名




书目名称Computing in the 90‘s年度引用




书目名称Computing in the 90‘s年度引用学科排名




书目名称Computing in the 90‘s读者反馈




书目名称Computing in the 90‘s读者反馈学科排名

贪心

袭击

Framing and Time Pressure in Decision Makingevery vertex of .. The .-eccentricity ... of a vertex . is the maximum .-distance from . to each vertex of . and the .-diameter ... is the maximum .-eccentricity among the vertices of .. For a tree ., a formula is given for ... and for . ≠ ϕ, it is shown that ... is even. Finally, the complexity of finding ... is discussed.

Obstreperous

Models For Nonstationary Time Series,are not believed to be polynomial for general graphs, are presented for connected block-complete graphs. These include: finding a minimum vertex cover, finding a minimum dominating set of radius r, and finding a minimum m-centrix radius r augmentation.

有限

bizarre

bizarre

Jonathan D. Cryer,Kung-Sik Chaninvariance when recognizing signal data in the form such as a formant. The preliminary development of the data structure, piecewise linear regression vectors, is reported. The new input data structure reduces the amount of data presented to the network by as much as an order of magnitude, giving a computational advantage in execution speed.

laparoscopy

Modeling and Solution Approach,Let .. be the .-dimensional hypercube. If .=2.+1, then the subgraph .. of .. induced by the nodes having exactly . or . + 1 ones is called the middle cube of dimension .. A famous conjecture is that .. is hamiltonian if .>1..Clearly, .. has two oriented hamiltonian cycles. This paper includes the following new results:

peptic-ulcer

micronized

Approximation algorithms for the chromatic sum,sum is NP-hard. In this article we prove that a simple greedy algorithm applied to sparse graphs gives a "good" approximation of the chromatic sum. For all graphs the existence of a polynomial time algorithm that approximates the chromatic sum with a linear function error implies P = NP.