21324 search results - page 4055 / 4265 » Making the case for computing |
169
click to vote
ASIACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
190
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
195
click to vote
EMSOFT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
173
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
175
click to vote
PFE
2001
Springer
15 years 11 months ago
2001
Springer
Although software mass customization offers the potential for order-of-magnitude improvements in software engineering performance, the up-front cost, level of effort, assumed risk,...