15421 search results - page 2780 / 3085 » Dependability |
215
click to vote
KDD
2009
ACM
15 years 12 months ago
2009
ACM
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
197
click to vote
WDAG
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
209
click to vote
ACISP
2001
Springer
15 years 12 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
366
click to vote
AGENTS
2001
Springer
15 years 12 months ago
2001
Springer
Through adjustable autonomy (AA), an agent can dynamically vary the degree to which it acts autonomously, allowing it to exploit human abilities to improve its performance, but wi...
225
click to vote
CCO
2001
Springer
15 years 12 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...