564 search results - page 84 / 113 » Approximation algorithms for restricted Bayesian network str... |
97
Voted
ISNN
2007
Springer
15 years 6 months ago
2007
Springer
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
152
click to vote
ANCS
2009
ACM
14 years 10 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
114
click to vote
ICALP
2009
Springer
16 years 24 days ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
120
Voted
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
92
Voted
MSWIM
2005
ACM
15 years 6 months ago
2005
ACM
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...