Search Results - "Computing methodologies Symbolic and algebraic manipulation"

Using symbolic evaluation to understand behavior in configurable software systems by Reisner, Elnatan, Song, Charles, Ma, Kin-Keung, Foster, Jeffrey S., Porter, Adam

“… We used symbolic evaluation to discover how the settings of run-time configuration options affect line, basic block, edge, and condition coverage for our subjects under a given test suite…”
Get full text

Distributed placement of power generation resources in uncertain environments by Gupta, Gaurav, Bogdan, Paul

“… The presented approach is applicable where a distribution of resources is required subject to challenges posed by uncertainty in the behavior of the environment…”
Get full text

Lattice QCD with domain decomposition on Intel® Xeon Phi™ co-processors by Heybrock, Simon, Joó, Bálint, Kalamkar, Dhiraj D., Smelyanskiy, Mikhail, Vaidyanathan, Karthikeyan, Wettig, Tilo, Dubey, Pradeep

“…The gap between the cost of moving data and the cost of computing continues to grow, making it ever harder to design iterative solvers on extreme-scale…”
Get full text

Energy-Efficient, Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model by Wu, Haisang, Ravindran, Binoy, Jensen, E. Douglas

“…). UAM embodies a "stronger" adversary than most arrival models. The algorithm considers application activities that are subject to time/utility function time…”
Get full text

A Markov chain sequence generator for power macromodeling by Liu, Xun, Papaefthymiou, Marios C.

“… computation problem, in which the matrix elements are subject to constraints derived from the specified statistics…”
Get full text

Boolean Technology Mapping Based on Logic Decomposition by Damiani, Maurizio, Selchenko, Andrei Y.

“… Decomposition information is also embedded in the representation of leaf-dags of the subject graph…”
Get full text

Linear decomposition algorithm for VLSI design applications by Li, Jianmin, Lillis, John, Cheng, Chung-Kuan

“… In our unified approach, the max-flow min-cut provides an optimal ordered partition subject to the given seeds and the eigenvector placement provides heuristic information for seed selection…”
Get full text