Sciweavers

1084 search results - page 128 / 217
» An approach to feature location in distributed systems
Sort
View
CONCUR
2001
Springer
14 years 15 days ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
14 years 8 months ago
Computer aided detection via asymmetric cascade of sparse hyperplane classifiers
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
Jinbo Bi, Senthil Periaswamy, Kazunori Okada, Tosh...
HPDC
2008
IEEE
14 years 2 months ago
Issues in applying data mining to grid job failure detection and diagnosis
As grid computation systems become larger and more complex, manually diagnosing failures in jobs becomes impractical. Recently, machine-learning techniques have been proposed to d...
Lakshmikant Shrinivas, Jeffrey F. Naughton
MIDDLEWARE
2005
Springer
14 years 1 months ago
Functional and architectural adaptation in pervasive computing environments
Service-oriented computing paradigm encourages the use of dynamic binding of application requirements to the resources needed to fulfill application tasks. Especially in pervasive...
Nanjangud C. Narendra, Umesh Bellur, S. K. Nandy, ...
FGCS
2010
108views more  FGCS 2010»
13 years 6 months ago
The wandering token: Congestion avoidance of a shared resource
In a distributed system where scalability is an issue, like in a GRID [5], the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mut...
Augusto Ciuffoletti