Sciweavers

310 search results - page 13 / 62
» From Non-Negative to General Operator Cost Partitioning
Sort
View
CODES
2004
IEEE
14 years 10 days ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
MOBIDE
2005
ACM
14 years 2 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
JPDC
2006
85views more  JPDC 2006»
13 years 8 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
KBSE
2003
IEEE
14 years 1 months ago
Tool-Assisted Unit Test Selection Based on Operational Violations
Unit testing, a common step in software development, presents a challenge. When produced manually, unit test suites are often insufficient to identify defects. The main alternativ...
Tao Xie, David Notkin
SIGCOMM
2010
ACM
13 years 8 months ago
Detecting the performance impact of upgrades in large operational networks
Networks continue to change to support new applications, improve reliability and performance and reduce the operational cost. The changes are made to the network in the form of up...
Ajay Anil Mahimkar, Han Hee Song, Zihui Ge, Aman S...