1756 search results - page 239 / 352 » Directed scale-free graphs |
112
click to vote
KDD
1995
ACM
15 years 4 months ago
1995
ACM
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
142
Voted
CCGRID
2008
IEEE
15 years 2 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
102
click to vote
CIE
2008
Springer
15 years 2 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
138
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Protecting sensitive information while preserving the shareability and usability of data is becoming increasingly important. In call-centers a lot of customer related sensitive in...
85
Voted
CEC
2005
IEEE
15 years 2 months ago
2005
IEEE
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...