Sciweavers

4565 search results - page 154 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
JUCS
2010
142views more  JUCS 2010»
13 years 8 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
14 years 1 months ago
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
Daniel M. Kane
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
14 years 1 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
ADHOCNETS
2009
Springer
14 years 5 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
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 10 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore