Sciweavers

5973 search results - page 812 / 1195
» Fundamental forms of information
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...
DESRIST
2009
Springer
118views Education» more  DESRIST 2009»
15 years 11 months ago
Building theory in the sciences of the artificial
This essay extends Simon’s arguments in the Sciences of the Artificial to a critical examination of how theorizing in Information Technology disciplines should occur. The essay ...
Shirley Gregor
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...
ICSE
2001
IEEE-ACM
15 years 11 months ago
Workshop on Software Engineering and Mobility
Mobility is redefining the hardware and software fabric of distributed systems. Wireless communication allows network hosts to participate in a distributed computation while on t...
Gruia-Catalin Roman, Gian Pietro Picco
INFOCOM
2000
IEEE
15 years 11 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper