Sciweavers

1933 search results - page 219 / 387
» A Dynamic Theory of Ontology
Sort
View
TIM
2010
144views Education» more  TIM 2010»
13 years 3 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
CORR
2011
Springer
265views Education» more  CORR 2011»
13 years 21 days ago
Signal Processing in Large Systems: a New Paradigm
—For a long time, signal processing applications, and most particularly detection and parameter estimation methods, have relied on the limiting behaviour of test statistics and e...
Romain Couillet, Mérouane Debbah
WWW
2003
ACM
14 years 9 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
CHI
2003
ACM
14 years 9 months ago
Media inequality in conversation: how people behave differently when interacting with computers and people
How is interacting with computer programs different from interacting with people? One answer in the literature is that these two types of interactions are similar. The present stu...
Nicole Shechtman, Leonard M. Horowitz
ATAL
2009
Springer
14 years 3 months ago
Multiagent learning in large anonymous games
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ï...
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern