Sciweavers

183 search results - page 32 / 37
» Practical Random Number Generation in Software
Sort
View
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 3 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
IPPS
2003
IEEE
14 years 1 months ago
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
SIGSOFT
2007
ACM
14 years 9 months ago
Does a programmer's activity indicate knowledge of code?
The practice of software development can likely be improved if an externalized model of each programmer's knowledge of a particular code base is available. Some tools already...
Thomas Fritz, Gail C. Murphy, Emily Hill
KBSE
2005
IEEE
14 years 2 months ago
Automating experimentation on distributed testbeds
Engineering distributed systems is a challenging activity. This is partly due to the intrinsic complexity of distributed systems, and partly due to the practical obstacles that de...
Yanyan Wang, Matthew J. Rutherford, Antonio Carzan...
EMSOFT
2009
Springer
14 years 3 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu