Sciweavers

3907 search results - page 163 / 782
» Time, Knowledge, and Choice
Sort
View
STACS
2005
Springer
16 years 11 hour ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
Abraham Flaxman, Bartosz Przydatek
FMOODS
2007
15 years 8 months ago
Formal Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Real-Time Maude
This paper describes the application of Real-Time Maude to the formal specification, simulation, and further formal analysis of the sophisticated state-of-the-art OGDC wireless se...
Peter Csaba Ölveczky, Stian Thorvaldsen
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
16 years 7 months ago
Efficient Time Series Matching by Wavelets
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
Kin-pong Chan, Ada Wai-Chee Fu
RTAS
2008
IEEE
16 years 27 days ago
Throttling On-Disk Schedulers to Meet Soft-Real-Time Requirements
To achieve better throughput, many hard drive manufacturers use internal queues and scheduling to take advantage of vendor-specific characteristics and knowledge. While this tren...
Mark J. Stanovich, Theodore P. Baker, An-I Andy Wa...
IPPS
2006
IEEE
16 years 17 days ago
Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
Peter Csaba Ölveczky, Stian Thorvaldsen