432 search results - page 36 / 87 » Open Problems with Part-Whole Relations |
NN
2006
Springer
15 years 12 days ago
2006
Springer
This paper introduces a generic theoretical framework for predictive learning, and relates it to data-driven and learning applications in earth and environmental sciences. The iss...
50
Voted
SAC
2008
ACM
14 years 12 months ago
2008
ACM
Goal models are effective in capturing stakeholder needs at the time when features of the system-to-be have not yet been conceptualized. Relating goals to solution-oriented featur...
114
Voted
CORR
2006
Springer
15 years 15 days ago
2006
Springer
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
126
Voted
DAM
1999
15 years 4 days ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
JCSS
2010
14 years 11 months ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...