Sciweavers

6229 search results - page 1192 / 1246
» Models of Computation for Networks on Chip
Sort
View
HT
2007
ACM
14 years 22 days ago
Identifying subcommunities using cohesive subgroups in social hypertext
Web pages can be modeled as nodes in a social network, and hyperlinks between pages form links (relationships) between the nodes. Links may take the form of comments, for example ...
Alvin Chin, Mark H. Chignell
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
14 years 18 days ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
GIS
2000
ACM
14 years 14 days ago
The NASA Digital Earth Testbed
The goal of Digital Earth (www.digitalearth.gov) is to create a virtual representation of our planet that enables a person to explore and interact with the vast amounts of natural...
Jeff de La Beaujardière, Horace Mitchell, R...
AAAI
2007
13 years 11 months ago
COD: Online Temporal Clustering for Outbreak Detection
We present Cluster Onset Detection (COD), a novel algorithm to aid in detection of epidemic outbreaks. COD employs unsupervised learning techniques in an online setting to partiti...
Tomás Singliar, Denver Dash
ATAL
2008
Springer
13 years 11 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
« Prev « First page 1192 / 1246 Last » Next »