Sciweavers

1243 search results - page 10 / 249
» On the locality of bounded growth
Sort
View
AIPS
2006
13 years 9 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith
NAS
2010
IEEE
13 years 6 months ago
Time-Bounded Essential Localization for Wireless Sensor Networks
In many practical applications of wireless sensor networks, it is crucial to accomplish the localization of sensors within a given time bound. We find that the traditional defin...
Wei Cheng, Nan Zhang 0004, Min Song, Dechang Chen,...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 1 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
ESORICS
2009
Springer
14 years 8 months ago
ID-Based Secure Distance Bounding and Localization
In this paper, we propose a novel ID-based secure distance bounding protocol. Unlike traditional secure distance measurement protocols, our protocol is based on standard insecure d...
Nils Ole Tippenhauer, Srdjan Capkun
WOWMOM
2006
ACM
122views Multimedia» more  WOWMOM 2006»
14 years 1 months ago
Multiple-Access Insights from Bounds on Sensor Localization
In this paper, we build on known bounds on localization in sensor networks and provide new insights that can be used in multiple-access design from a localization perspective. Spe...
Swaroop Venkatesh, R. Michael Buehrer