1137 search results - page 101 / 228 » Partial Program Admission |
123
click to vote
ICALP
1998
Springer
15 years 6 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
98
Voted
AIPS
2004
15 years 3 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
136
click to vote
TCAD
2002
15 years 2 months ago
2002
The objective of this work is to create a framework for the optimization of embedded software. We present algorithms and a tool flow to reduce the computational effort of programs,...
131
click to vote
ICFP
2002
ACM
16 years 2 months ago
2002
ACM
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
144
click to vote
PEPM
1993
ACM
15 years 6 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...