205 search results - page 3 / 41 » Independent Additive Heuristics Reduce Search Multiplicative... |
LCN
2007
IEEE
14 years 1 months ago
2007
IEEE
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
AAAI
2008
13 years 9 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
IUI
1993
ACM
13 years 11 months ago
1993
ACM
incompatibility. We introduce Mona, an operational email system embodying this automatic approach. Mona establishes conversation context independently of user actions through the ...
SIGCOMM
2010
ACM
13 years 7 months ago
2010
ACM
In backbone networks, the line cards that drive the links between neighboring routers consume a large amount of energy. Since these networks are typically overprovisioned, selecti...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...