The conventional weighted aggregation method is extended to realize multi-objective optimization. The basic idea is that systematically changing the weights during evolution will l...
Fornberg and Meyer-Spasche proposed some time ago a simple strategy to correct finite difference schemes in the presence of a free boundary that cuts across a Cartesian grid. We sh...
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...