8413 search results - page 155 / 1683 » Ordering Problem Subgoals |
117
click to vote
ISMIS
1999
Springer
15 years 7 months ago
1999
Springer
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
155
click to vote
JCT
2010
15 years 1 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
112
click to vote
ADHOCNOW
2009
Springer
15 years 9 months ago
2009
Springer
We deal with the rate allocation problem for downlink in a Multi-hop Cellular Network. A mathematical model is provided to assign transmission rates in order to reach an optimal an...
138
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
122
click to vote
POPL
2010
ACM
16 years 6 days ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...