1736 search results - page 275 / 348 » On antimagic directed graphs |
DELTA
2004
IEEE
15 years 3 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
ILP
2000
Springer
15 years 3 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
103
click to vote
KDD
1995
ACM
15 years 3 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...
128
click to vote
CCGRID
2008
IEEE
15 years 1 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...
CIE
2008
Springer
15 years 1 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...