3267 search results - page 442 / 654 » Generalized quasirandom graphs |
169
click to vote
JCDL
2004
ACM
16 years 19 hour ago
2004
ACM
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
152
click to vote
PODC
2004
ACM
16 years 17 hour ago
2004
ACM
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
160
click to vote
SIGCSE
2004
ACM
16 years 16 hour ago
2004
ACM
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
165
click to vote
SIGECOM
2004
ACM
16 years 15 hour ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
162
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...