Sciweavers

7065 search results - page 1142 / 1413
» Iterative Scheduling Algorithms
Sort
View
TSP
2008
101views more  TSP 2008»
15 years 6 months ago
Reduced-Complexity Soft MIMO Detection Based on Causal and Noncausal Decision Feedback
We present a reduced-complexity soft detection (RCSD) scheme geared to multiple-input multiple-output (MIMO) systems with spatial domain multiplexing leading to layered space-time ...
Yong Li, Jaekyun Moon
AI
2002
Springer
15 years 6 months ago
Multiagent learning using a variable learning rate
Learning to act in a multiagent environment is a difficult problem since the normal definition of an optimal policy no longer applies. The optimal policy at any moment depends on ...
Michael H. Bowling, Manuela M. Veloso
CGF
1998
127views more  CGF 1998»
15 years 6 months ago
Getting Rid of Links in Hierarchical Radiosity
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
Marc Stamminger, Hartmut Schirmacher, Philipp Slus...
ML
2002
ACM
141views Machine Learning» more  ML 2002»
15 years 6 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir
TAPOS
1998
126views more  TAPOS 1998»
15 years 6 months ago
Design of Class Hierarchies Based on Concept (Galois) Lattices
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices a...
Robert Godin, Hafedh Mili, Guy W. Mineau, Rokia Mi...
« Prev « First page 1142 / 1413 Last » Next »