Sciweavers

1277 search results - page 58 / 256
» Terminating Decision Algorithms Optimally
Sort
View
JCIT
2010
160views more  JCIT 2010»
14 years 10 months ago
TOPSIS Method for Multiple Attribute Decision Making with Incomplete Weight Information in Linguistic Setting
The aim of this paper is to investigate the multiple attribute decision making problems with linguistic information, in which the information about attribute weights is incomplete...
Jianli Wei
AAAI
1994
15 years 4 months ago
Acting Optimally in Partially Observable Stochastic Domains
In this paper, we describe the partially observable Markov decision process pomdp approach to nding optimal or near-optimal control strategies for partially observable stochastic ...
Anthony R. Cassandra, Leslie Pack Kaelbling, Micha...
ILP
1997
Springer
15 years 7 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
BMCBI
2007
118views more  BMCBI 2007»
15 years 3 months ago
A topological algorithm for identification of structural domains of proteins
Background: Identification of the structural domains of proteins is important for our understanding of the organizational principles and mechanisms of protein folding, and for ins...
Frank Emmert-Streib, Arcady R. Mushegian
ICC
2007
IEEE
197views Communications» more  ICC 2007»
15 years 9 months ago
A Distributed Scheduling Algorithm for Multiuser MIMO Systems with 1-bit SINR Feedback
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
Stefano Sorrentino, Umberto Spagnolini, Lino Moret...