16404 search results - page 2414 / 3281 » A set coverage problem |
227
click to vote
CORR
2004
Springer
15 years 7 months ago
2004
Springer
We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of in...
189
click to vote
ETS
2000
IEEE
15 years 7 months ago
2000
IEEE
Practice has shown that providing content to students alone is not sufficient for good learning results. In computer based training (CBT) and especially webbased training (WBT) en...
237
click to vote
EC
1998
15 years 7 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
222
click to vote
MCS
2002
Springer
15 years 7 months ago
2002
Springer
Abstract. While a variety of multiple classifier systems have been studied since at least the late 1950's, this area came alive in the 90's with significant theoretical a...
211
click to vote
MP
1998
15 years 7 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...