Sciweavers

344 search results - page 48 / 69
» A constant factor approximation algorithm for a class of cla...
Sort
View
SPIRE
2010
Springer
13 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
MP
2008
126views more  MP 2008»
13 years 7 months ago
Geometry of interpolation sets in derivative free optimization
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...
Andrew R. Conn, Katya Scheinberg, Luís N. V...
INFOCOM
2007
IEEE
14 years 1 months ago
Diagnosing Link-Level Anomalies Using Passive Probes
Abstract—In this paper, we develop passive network tomography techniques for inferring link-level anomalies like excessive loss rates and delay from path-level measurements. Our ...
Shipra Agrawal, K. V. M. Naidu, Rajeev Rastogi
WINE
2007
Springer
151views Economy» more  WINE 2007»
14 years 1 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
ADHOCNETS
2009
Springer
14 years 2 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao