5183 search results - page 373 / 1037 » The Complexity of Distributions |
200
click to vote
ICPADS
2007
IEEE
16 years 1 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
183
click to vote
CONCUR
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
170
click to vote
ECAL
2007
Springer
16 years 28 days ago
2007
Springer
In this paper1 , we introduce a method, Assortative Preferential Attachment, to grow a scale-free network with a given assortativeness value. Utilizing this method, we investigate ...
158
click to vote
C5
2006
IEEE
16 years 24 days ago
2006
IEEE
Based on research conducted at a large multinational corporation, we identified several unique requirements for global team collaboration. Our findings included that two-thirds of...
165
click to vote
EDOC
2006
IEEE
16 years 24 days ago
2006
IEEE
The RM-ODP standard still provides the only comprehensive and coherent framework of concepts for the specification of complex large scale IT systems, and has taken on a new signif...