1941 search results - page 307 / 389 » On the Hardness of Approximate Reasoning |
197
click to vote
AINA
2005
IEEE
15 years 11 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
162
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
165
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
184
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
156
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...