2016 search results - page 175 / 404 » Megamaps: Construction and Examples |
207
click to vote
CASCON
1996
15 years 7 months ago
1996
Organizations have become increasingly dependent on computing systems to achieve their business goals. The performance of these systems in terms of response times and cost has a m...
162
click to vote
IJCAI
1993
15 years 7 months ago
1993
This paper presents an analysis of static and dynamic organizational structures for naturally distributed, homogeneous, cooperative problem solving environments, exemplified by di...
152
click to vote
SODA
1996
ACM
15 years 7 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
209
click to vote
AIPS
2009
15 years 7 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
150
click to vote
APVIS
2009
15 years 7 months ago
2009
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...