Sciweavers

1609 search results - page 153 / 322
» Problem Structure and Dependable Architecture
Sort
View
IFIP
2004
Springer
15 years 5 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
124
Voted
AGENTS
1997
Springer
15 years 4 months ago
Integrating Communicative Action, Conversations and Decision Theory to Coordinate Agents
The coordination problem in multi-agent systems is the problem of managing dependencies between the activities of autonomous agents, in conditions of incomplete knowledge about th...
Mihai Barbuceanu, Mark S. Fox
97
Voted
SC
1995
ACM
15 years 4 months ago
Distributing a Chemical Process Optimization Application Over a Gigabit Network
We evaluate the impact of a gigabit network on the implementation of a distributed chemical process optimization application. The optimization problem is formulated as a stochasti...
Robert L. Clay, Peter Steenkiste
MCS
2001
Springer
15 years 4 months ago
Finding Consistent Clusters in Data Partitions
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
Ana L. N. Fred
82
Voted
ICIP
2001
IEEE
16 years 2 months ago
Robust estimation of depth and motion using stochastic approximation
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
Rama Chellappa, Amit K. Roy Chowdhury