Sciweavers

21324 search results - page 489 / 4265
» Making the case for computing
Sort
View
JAL
2007
95views more  JAL 2007»
15 years 7 months ago
Computing shortest paths with uncertainty
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
Tomás Feder, Rajeev Motwani, Liadan O'Calla...
CCE
2005
15 years 7 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen
TSMC
2002
95views more  TSMC 2002»
15 years 6 months ago
On the development of a cooperative tutoring environment on computer networks
Abstract--In developing a tutoring system, one of the most difficult tasks is to collect tutoring knowledge from multiple educators, especially courses in which the contents change...
Gwo-Jen Hwang
JDCTA
2010
172views more  JDCTA 2010»
15 years 1 months ago
Performance Test of An Embedded Real-Time Operating System Based on A New High-Security NetWork Computer
Performance indexes of the embedded real-time operating system are not isolated but interacting with each other. Two sets of elements aiming to describe the relationship between t...
Gengxin Sun, Fengjing Shao Name, Sheng Bin
CCIA
2005
Springer
16 years 18 days ago
Using symbolic descriptions to explain similarity on CBR
The explanation of the results is a key point of automatic problem solvers. CBR systems solve a new problem by assessing its similarity with already solved cases and they commonly ...
Eva Armengol, Enric Plaza