3267 search results - page 355 / 654 » Generalized quasirandom graphs |
174
click to vote
ACMSE
2006
ACM
16 years 21 days ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
191
click to vote
VALUETOOLS
2006
ACM
16 years 20 days ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
184
click to vote
ATAL
2005
Springer
16 years 8 days ago
2005
Springer
Whilst tools assist the various tasks required to develop a multi-agent system (MAS), yet there still remains a gap between the generation of MAS models and program code. AUML dev...
163
click to vote
WINE
2005
Springer
16 years 6 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
191
click to vote
ESA
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...