Sciweavers

3122 search results - page 245 / 625
» A Theory of Network Equivalence
Sort
View
EOR
2008
136views more  EOR 2008»
15 years 6 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
TSMC
2010
15 years 1 months ago
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
Abstract--This paper considers a second-order consensus problem for multiagent systems with nonlinear dynamics and directed topologies where each agent is governed by both position...
Wenwu Yu, Guanrong Chen, Ming Cao, Jürgen Kur...
IWANN
2011
Springer
14 years 9 months ago
A Preliminary Study on the Use of Fuzzy Rough Set Based Feature Selection for Improving Evolutionary Instance Selection Algorith
In recent years, the increasing interest in fuzzy rough set theory has allowed the definition of novel accurate methods for feature selection. Although their stand-alone applicati...
Joaquín Derrac, Chris Cornelis, Salvador Ga...
188
Voted
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 11 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
15 years 8 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...