Sciweavers

535 search results - page 63 / 107
» Predicting Application Run Times Using Historical Informatio...
Sort
View
BMCBI
2008
122views more  BMCBI 2008»
15 years 2 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
ADAEUROPE
2007
Springer
15 years 8 months ago
Towards the Testing of Power-Aware Software Applications for Wireless Sensor Networks
The testing of programs in wireless sensor networks (WSN) is an important means to assure quality but is a challenging process. As pervasive computing has been identified as a not...
W. K. Chan, Tsong Yueh Chen, S. C. Cheung, T. H. T...
ICASSP
2008
IEEE
15 years 8 months ago
An information theoretic approach to processing management
In region surveillance applications, sensors oftentimes accumulate an overwhelmingly large amount of data, making it infeasible to process all of the collected data in real-time. ...
Christopher M. Kreucher, Kevin M. Carter
GRID
2007
Springer
15 years 8 months ago
Eliciting honest value information in a batch-queue environment
Abstract— Markets and auctions have been proposed as mechanisms for efficiently and fairly allocating resources in a number of different computational settings. Economic approac...
Andrew Mutz, Richard Wolski, John Brevik
FPL
2008
Springer
111views Hardware» more  FPL 2008»
15 years 3 months ago
Hyperreconfigurable architectures
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
Sebastian Lange, Martin Middendorf