4451 search results - page 182 / 891 » On Random Ordering Constraints |
146
click to vote
WAW
2009
Springer
15 years 11 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
127
click to vote
ACSAC
2006
IEEE
15 years 11 months ago
2006
IEEE
Instruction Set Randomization (ISR) has been proposed as a form of defense against binary code injection into an executing program. One proof-of-concept implementation is Randomiz...
132
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
137
click to vote
ICCSA
2004
Springer
15 years 10 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
150
Voted
SP
2003
IEEE
15 years 10 months ago
2003
IEEE
Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because th...