1686 search results - page 35 / 338 » Programs as polygraphs: computability and complexity |
INFORMS
1998
14 years 9 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
We study how several collective operations like broadcast, reduction, scan, etc. can be composed efficiently in complex parallel programs. Our specific contributions are: (1) a fo...
WSC
1998
14 years 11 months ago
1998
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
INFORMS
1998
14 years 9 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
IJHPCA
2010
14 years 8 months ago
2010
As high-end computing systems continue to grow in scale, recent advances in multiand many-core architectures have pushed such growth toward more denser architectures, that is, mor...