2038 search results - page 126 / 408 » Loops under Strategies |
130
click to vote
MST
2000
15 years 3 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
150
click to vote
NETWORKS
2010
15 years 2 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
136
click to vote
ATAL
2011
Springer
14 years 4 months ago
2011
Springer
Motivated by a machine learning perspective—that gametheoretic equilibria constraints should serve as guidelines for predicting agents’ strategies, we introduce maximum causal...
134
click to vote
IPCCC
2006
IEEE
15 years 10 months ago
2006
IEEE
In recent years, malicious software (malware) has become one of the most insidious threats in computer security. However, this is arguably not the result of increased sophisticati...
157
click to vote
CASES
2003
ACM
15 years 9 months ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...