Sciweavers

979 search results - page 161 / 196
» Optimal instruction scheduling using integer programming
Sort
View
IEEEPACT
2000
IEEE
14 years 1 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
MICRO
2000
IEEE
176views Hardware» more  MICRO 2000»
13 years 8 months ago
An Advanced Optimizer for the IA-64 Architecture
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
Rakesh Krishnaiyer, Dattatraya Kulkarni, Daniel M....
CP
2009
Springer
14 years 9 months ago
Coalition Structure Generation Utilizing Compact Characteristic Function Representations
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko S...
COMSWARE
2007
IEEE
14 years 3 months ago
On Optimal Performance in Mobile Ad hoc Networks
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...
Tapas K. Patra, Joy Kuri, Pavan Nuggehalli
SOFSEM
2012
Springer
12 years 4 months ago
Turing Machines for Dummies - Why Representations Do Matter
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
Peter van Emde Boas