Sciweavers

691 search results - page 89 / 139
» Genetic Programming Applied to Mixed Integer Programming
Sort
View
LCTRTS
2005
Springer
15 years 8 months ago
A sample-based cache mapping scheme
Applications running on the StrongARM SA-1110 or XScale processor cores can specify cache mapping for each virtual page to achieve better cache utilization. In this work, we descr...
Rong Xu, Zhiyuan Li
CPAIOR
2011
Springer
14 years 6 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
146
Voted
ISCA
2012
IEEE
208views Hardware» more  ISCA 2012»
13 years 5 months ago
Harmony: Collection and analysis of parallel block vectors
Efficient execution of well-parallelized applications is central to performance in the multicore era. Program analysis tools support the hardware and software sides of this effor...
Melanie Kambadur, Kui Tang, Martha A. Kim
101
Voted
ICNC
2009
Springer
15 years 9 months ago
Estimating Strength of Concrete Using a Grammatical Evolution
The main purpose of this paper is to propose an incorporating a grammatical evolution (GE) into the genetic algorithm (GA), called GEGA, and apply it to estimate the compressive s...
Hsun-Hsin Hsu, Li Chen, Chang-Huan Kou, Tai-Sheng ...
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
15 years 8 months ago
New Results on the Complexity of the Middle Bit of Multiplication
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
Ingo Wegener, Philipp Woelfel