397 search results - page 49 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
WEA
2010
Springer
14 years 3 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
IPCO
2007
13 years 11 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
TSP
2011
13 years 5 months ago
2011
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
PODC
2003
ACM
14 years 3 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
CAAN
2007
Springer
14 years 2 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...