Sciweavers

11862 search results - page 2145 / 2373
» Relative information completeness
Sort
View
IEEEHPCS
2010
15 years 3 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...
IJAR
2010
130views more  IJAR 2010»
15 years 3 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki
IJITM
2010
93views more  IJITM 2010»
15 years 3 months ago
A group evidential reasoning approach for enterprise architecture framework selection
: Enterprise architecture (EA) frameworks are used to ensure interoperability of information systems and improve the effectiveness and efficiency of business organisations. Several...
Faramak Zandi, Madjid Tavana
IJLT
2010
115views more  IJLT 2010»
15 years 3 months ago
Computer supported ubiquitous learning environment for vocabulary learning
: Ubiquitous computing could help the organisation and the mediation of social interactions wherever and whenever these situations might occur. Using those technologies enables the...
Hiroaki Ogata, Chengjiu Yin, Moushir M. El-Bishout...
142
Voted
IPL
2010
114views more  IPL 2010»
15 years 3 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
« Prev « First page 2145 / 2373 Last » Next »