Sciweavers

16430 search results - page 893 / 3286
» On Computable Tree Functions
Sort
View
IJAR
2006
103views more  IJAR 2006»
15 years 7 months ago
Computing mean and variance under Dempster-Shafer uncertainty: Towards faster algorithms
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
Vladik Kreinovich, Gang Xiang, Scott Ferson
SIAMSC
2008
127views more  SIAMSC 2008»
15 years 7 months ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu
IJIPT
2007
116views more  IJIPT 2007»
15 years 7 months ago
Context as autonomic intelligence in a ubiquitous computing environment
: This paper presents the ANS architecture that uses ubiquitous computing to monitor medical patients in the home. Since there is no notion of the patient carrying out maintenance ...
Markus C. Huebscher, Julie A. McCann, Asher Hoskin...
CCE
2005
15 years 7 months ago
Interactive evolutionary computation in process engineering
In practical system identification, process optimization and controller design, it is often desirable to simultaneously handle several objectives and constraints. In some cases, t...
János Madár, János Abonyi, Fe...
TC
2002
15 years 7 months ago
The Timely Computing Base Model and Architecture
Abstract-- Current systems are very often based on largescale, unpredictable and unreliable infrastructures. However, users of these systems increasingly require services with time...
Paulo Veríssimo, Antonio Casimiro