8232 search results - page 1470 / 1647 » Dynamic Logic Programming |
161
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
150
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
147
Voted
OOPSLA
2005
Springer
15 years 11 months ago
2005
Springer
As a value flows across the boundary between interoperating languages, it must be checked and converted to fit the types and representations of the target language. For simple f...
136
Voted
SAMOS
2005
Springer
15 years 11 months ago
2005
Springer
—We describe the generation of the simulation environment for the Sandbridge Sandblaster multithreaded processor. The processor model is described using the Sandblaster architect...
164
Voted
STACS
2005
Springer
15 years 11 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...