1139 search results - page 218 / 228 » Bounded Ideation Theory |
169
click to vote
STOC
1993
ACM
15 years 3 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
113
click to vote
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Integrating contributions received from other agents is an essential activity in multi-agent systems (MASs). Not only must related contributions be integrated together, but the co...
124
click to vote
CCA
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
KDD
2010
ACM
15 years 2 months ago
2010
ACM
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...