Sciweavers

5675 search results - page 177 / 1135
» Exploiting Chaos for Computation
Sort
View
121
Voted
WSC
2004
15 years 6 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol
SP
2008
IEEE
115views Security Privacy» more  SP 2008»
15 years 4 months ago
Complexity in scalable computing
f abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Resear...
Damian W. I. Rouson
171
Voted
TSMC
2002
134views more  TSMC 2002»
15 years 4 months ago
Incorporating soft computing techniques into a probabilistic intrusion detection system
There are a lot of industrial applications that can be solved competitively by hard computing, while still requiring the tolerance for imprecision and uncertainty that can be explo...
Sung-Bae Cho
TOMS
2010
106views more  TOMS 2010»
15 years 3 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
157
Voted
SOCIALCOM
2010
14 years 11 months ago
A Multi-factor Approach to Securing Software on Client Computing Platforms
Protecting the integrity of software platforms, especially in unmanaged consumer computing systems is a difficult problem. Attackers may attempt to execute buffer overflow attacks ...
Raghunathan Srinivasan, Vivek Iyer, Amit Kanitkar,...