Sciweavers

529 search results - page 8 / 106
» The Optimal Fixed Point Combinator
Sort
View
NECO
2000
86views more  NECO 2000»
14 years 9 months ago
A Bayesian Committee Machine
The Bayesian committee machine (BCM) is a novel approach to combining estimators which were trained on different data sets. Although the BCM can be applied to the combination of a...
Volker Tresp
CEC
2008
IEEE
15 years 4 months ago
Divide and conquer evolutionary TSP solution for vehicle path planning
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
Ryan J. Meuth, Donald C. Wunsch
SODA
2004
ACM
58views Algorithms» more  SODA 2004»
14 years 11 months ago
Point containment in the integer hull of a polyhedron
We show that the point containment problem in the integer hull of a polyhedron, which is defined by m inequalities, with coefficients of at most bits can be solved in time O(m + ...
Ernst Althaus, Friedrich Eisenbrand, Stefan Funke,...
GLOBECOM
2006
IEEE
15 years 3 months ago
Relay-Assisted Spatial Multiplexing in Wireless Fixed Relay Networks
— Fixed relays are expected to be a part of future infrastructure-based wireless networks. Besides coverage extension, such relays can form advanced architectures due to the fle...
Furuzan Atay Onat, Halim Yanikomeroglu, Shalini S....
TSP
2008
86views more  TSP 2008»
14 years 9 months ago
Fixed-Complexity Soft MIMO Detection via Partial Marginalization
Abstract--This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer....
Erik G. Larsson, Joakim Jalden