Sciweavers

253 search results - page 16 / 51
» Conditional Symmetry Breaking
Sort
View
CP
2010
Springer
14 years 8 months ago
Load Balancing and Almost Symmetries for RAMBO Quorum Hosting
Abstract. Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where t...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
AIMS
2007
Springer
15 years 3 months ago
Modeling Change Without Breaking Promises
Promise theory defines a method by which static service bindings are made in a network, but little work has been done on handling the dynamic case in which bindings must change ov...
Alva L. Couch, Hengky Susanto, Marc Chiarini
MA
2010
Springer
135views Communications» more  MA 2010»
14 years 8 months ago
Asymptotic expansion of the minimum covariance determinant estimators
In Cator and Lopuha¨a [3] an asymptotic expansion for the MCD estimators is established in a very general framework. This expansion requires the existence and non-singularity of ...
Eric A. Cator, Hendrik P. Lopuhaä
MVA
2007
230views Computer Vision» more  MVA 2007»
14 years 11 months ago
A Rear Vehicle Location Algorithm for Lane Change Assist
A monocular vision based location algorithm is presented to detect and track rear vehicles for lane change assist. The algorithm uses the shadow underneath the vehicle to extract ...
Wei Liu, Chunyan Song, Pengyu Fu, Nan Wang, Huai Y...
CP
2006
Springer
15 years 1 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi