Sciweavers

303 search results - page 7 / 61
» Link-Time Improvement of Scheme Programs
Sort
View
CP
2005
Springer
14 years 1 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CEC
2005
IEEE
14 years 1 months ago
Linear genetic programming using a compressed genotype representation
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
Johan Parent, Ann Nowé, Kris Steenhaut, Ann...
CGO
2004
IEEE
13 years 11 months ago
A Compiler Scheme for Reusing Intermediate Computation Results
Recent research has shown that programs often exhibit value locality. Such locality occurs when a code segment, although executed repeatedly in the program, takes only a small num...
Yonghua Ding, Zhiyuan Li
PLDI
1995
ACM
13 years 11 months ago
Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages
d Abstract) Alexander Aiken Manuel F¨ahndrich Raph Levieny Computer Science Division University of California, Berkeleyz Static memory managementreplaces runtime garbage collecti...
Alexander Aiken, Manuel Fähndrich, Raph Levie...
INFOCOM
2010
IEEE
13 years 6 months ago
Resource Allocation in Multi-cell OFDMA-based Relay Networks
Abstract— Cooperative relay networks combined with Orthogonal Frequency Division Multiplexing Access (OFDMA) technology has been widely recognized as a promising candidate for fu...
Yao Hua, Qian Zhang, Zhisheng Niu