Sciweavers

13706 search results - page 2505 / 2742
» Information Problems in Information Society
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 11 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
ICSE
2010
IEEE-ACM
15 years 11 months ago
A methodology to support load test analysis
Performance analysts rely heavily on load testing to measure the performance of their applications under a given load. During the load test, analyst strictly monitor and record th...
Haroon Malik
209
Voted
IWCMC
2009
ACM
15 years 11 months ago
Graph coloring based physical-cell-ID assignment for LTE networks
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
Tobias Bandh, Georg Carle, Henning Sanneck
AGENTS
2001
Springer
15 years 11 months ago
Hierarchical multi-agent reinforcement learning
In this paper, we investigate the use of hierarchical reinforcement learning (HRL) to speed up the acquisition of cooperative multi-agent tasks. We introduce a hierarchical multi-a...
Rajbala Makar, Sridhar Mahadevan, Mohammad Ghavamz...
CIA
2001
Springer
15 years 11 months ago
Improving Communication in 3D Virtual Environments by Means of Task Delegation in Agents
User-to-User Communication within Internet-based 3D Virtual Environments is usually difficult mainly due to the trade-off between the capability and the complexity of the interface...
Ricardo Imbert, Angélica de Antonio, Javier...
« Prev « First page 2505 / 2742 Last » Next »