3717 search results - page 150 / 744 » Representing Multiple Theories |
177
Voted
CCECE
2006
IEEE
15 years 9 months ago
2006
IEEE
Presenting information to an e-learning environment is a challenge, mostly, because ofthe hypertextlhypermedia nature and the richness ofthe context and information provides. This...
119
Voted
CTCS
1989
Springer
15 years 7 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
114
Voted
CIE
2010
Springer
15 years 7 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
143
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
152
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...