16430 search results - page 417 / 3286 » On Computable Tree Functions |
250
click to vote
ICTAI
2003
IEEE
16 years 3 days ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
213
click to vote
NETWORKING
2011
14 years 9 months ago
2011
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Intern...
174
click to vote
AMAI
1999
Springer
15 years 6 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
192
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
205
click to vote
AAAI
2010
15 years 8 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...