Sciweavers

379 search results - page 27 / 76
» Strong reducibility of partial numberings
Sort
View
ACRI
2006
Springer
14 years 3 months ago
Optimal 6-State Algorithms for the Behavior of Several Moving Creatures
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells wi...
Mathias Halbach, Rolf Hoffmann, Lars Both
PIMRC
2010
IEEE
13 years 7 months ago
Low-complexity iteration control for MIMO-BICM systems
Air bandwidth is a precious resource for wireless communication. Multiple-antenna (MIMO) systems enable an increase in channel capacity without increasing the air bandwidth. An ite...
C. Gimmler, Timo Lehnigk-Emden, Norbert Wehn
JSAC
2007
120views more  JSAC 2007»
13 years 9 months ago
On the Capacity of MIMO Wireless Channels with Dynamic CSIT
Abstract— Transmit channel side information (CSIT) can significantly increase MIMO wireless capacity. Due to delay in acquiring this information, however, the time-selective fad...
Mai Vu, Arogyaswami Paulraj
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
14 years 3 months ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
QEST
2006
IEEE
14 years 3 months ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders