Sciweavers

19866 search results - page 379 / 3974
» Computing all factorizations in ***
Sort
View
POPL
2009
ACM
16 years 7 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
GPCE
2009
Springer
15 years 11 months ago
A generative programming approach to developing pervasive computing systems
Developing pervasive computing applications is a difficult task because it requires to deal with a wide range of issues: heterogeneous devices, entity distribution, entity coordi...
Damien Cassou, Benjamin Bertran, Nicolas Loriant, ...
BMCBI
2008
105views more  BMCBI 2008»
15 years 7 months ago
Novel computational methods for increasing PCR primer design effectiveness in directed sequencing
Background: Polymerase chain reaction (PCR) is used in directed sequencing for the discovery of novel polymorphisms. As the first step in PCR directed sequencing, effective PCR pr...
Kelvin Li, Anushka Brownley, Timothy B. Stockwell,...
MOBISYS
2005
ACM
16 years 6 months ago
Energy efficiency of handheld computer interfaces: limits, characterization and practice
Energy efficiency has become a critical issue for battery-driven computers. Significant work has been devoted to improving it through better software and hardware. However, the hu...
Lin Zhong, Niraj K. Jha
SOSP
2009
ACM
16 years 3 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...