Sciweavers

4679 search results - page 73 / 936
» Modeling When Connections Are the Problem
Sort
View
104
Voted
ICWS
2009
IEEE
15 years 10 months ago
What are the Problem Makers: Ranking Activities According to their Relevance for Process Changes
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
Chen Li, Manfred Reichert, Andreas Wombacher
PDPTA
2004
15 years 2 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 1 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 7 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
CORR
2000
Springer
88views Education» more  CORR 2000»
15 years 1 months ago
The lexicographic closure as a revision process
The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e...
Richard Booth