Sciweavers

27692 search results - page 272 / 5539
» Where is ...
Sort
View
ARTMED
1999
75views more  ARTMED 1999»
15 years 13 days ago
An intelligent system for pacemaker reprogramming
The process of reprogramming a cardiac pacemaker can be described in terms similar to those used for describing diagnostic problem solving. In this paper, the process of reprogram...
Peter J. F. Lucas, Astrid Tholen, Geeske van Oort
DM
1998
83views more  DM 1998»
15 years 13 days ago
The basis number of the powers of the complete graph
A basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h cycles of the basis. The basis number b(G) of G is the least integer h such that C(G) ...
Salar Y. Alsardary, Jerzy Wojciechowski
93
Voted
JAT
2002
62views more  JAT 2002»
15 years 12 days ago
Coconvex Approximation
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...
Dany Leviatan, Igor A. Shevchuk
JIRS
2002
78views more  JIRS 2002»
15 years 12 days ago
A Mobile Agents Approach to Virtual Laboratories and Remote Supervision
This paper presents the use of adaptive mobile agents for remote operation, enabling real-time response in spite of the limitations of the communication channels in terms of time-d...
Luis M. Camarinha-Matos, Octavio Castolo, Walter V...
109
Voted
JCO
1998
97views more  JCO 1998»
15 years 12 days ago
The Travelling Salesman Problem on Permuted Monge Matrices
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....