Sciweavers

281 search results - page 47 / 57
» heuristics 2000
Sort
View
IJAIT
2008
99views more  IJAIT 2008»
13 years 9 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
JAIR
2000
152views more  JAIR 2000»
13 years 9 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
CGO
2010
IEEE
13 years 7 months ago
On improving heap memory layout by dynamic pool allocation
Dynamic memory allocation is widely used in modern programs. General-purpose heap allocators often focus more on reducing their run-time overhead and memory space utilization, but...
Zhenjiang Wang, Chenggang Wu, Pen-Chung Yew
PLDI
2003
ACM
14 years 2 months ago
A compiler framework for speculative analysis and optimizations
Speculative execution, such as control speculation and data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristi...
Jin Lin, Tong Chen, Wei-Chung Hsu, Pen-Chung Yew, ...
IPPS
2000
IEEE
14 years 2 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke