Sciweavers

1594 search results - page 252 / 319
» Fast Prediction on a Tree
Sort
View
TEC
2002
119views more  TEC 2002»
13 years 9 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...
FOCM
2010
100views more  FOCM 2010»
13 years 8 months ago
Higher-Order Averaging, Formal Series and Numerical Integration I: B-series
We show how B-series may be used to derive in a systematic way the analytical expressions of the high-order stroboscopic averaged equations that approximate the slow dynamics of h...
P. Chartier, A. Murua, J. M. Sanz-Serna
INFOCOM
2010
IEEE
13 years 8 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
PVLDB
2010
105views more  PVLDB 2010»
13 years 8 months ago
Destabilizers and Independence of XML Updates
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
Michael Benedikt, James Cheney
INFOCOM
2010
IEEE
13 years 7 months ago
Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks
Abstract--Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting m...
János Tapolcai, Lajos Rónyai, Pin-Ha...