For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
Abstract. Typical analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long history of their successful use. ...
In this paper we present a new method of interval fuzzy model identification. The method combines a fuzzy identification methodology with some ideas from linear programming theory...
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
Armin Eftekhari, Justin K. Romberg, Michael B. Wak...
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...