15033 search results - page 71 / 3007 » Complexity Theory and Algorithms |
113
click to vote
CADE
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex syst...
147
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
148
Voted
AGI
2011
14 years 7 months ago
2011
We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as ...
108
Voted
RECSYS
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
117
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...