Sciweavers

1510 search results - page 95 / 302
» Upper Probabilities and Additivity
Sort
View
TIT
2008
61views more  TIT 2008»
14 years 9 months ago
Performance of Space-Time Codes: Gallager Bounds and Weight Enumeration
Since the standard union bound for space-time codes may diverge in quasi-static fading channels, the limit-before-average technique has been exploited to derive tight performance b...
Cong Ling, Kwok H. Li, Alex ChiChung Kot
AROBOTS
2004
93views more  AROBOTS 2004»
14 years 9 months ago
Propagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results
This paper examines the problem of cooperative localization for the case of large groups of mobile robots. A Kalman filter estimator is implemented and tested for this purpose. The...
Stergios I. Roumeliotis, Ioannis M. Rekleitis
JMIV
2002
129views more  JMIV 2002»
14 years 9 months ago
Grain Filters
Motivated by operators simplifying the topographic map of a function, we study the theoretical properties of two kinds of "grain" filters. The first category, discovered ...
Vicent Caselles, Pascal Monasse
DLOG
2010
14 years 7 months ago
Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...
Chan Le Duc, Myriam Lamolle
ANOR
2011
131views more  ANOR 2011»
14 years 4 months ago
A branch-and-bound algorithm for hard multiple knapsack problems
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
Alex S. Fukunaga