Sciweavers

686 search results - page 62 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
135
Voted
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
15 years 7 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
144
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
MSWIM
2009
ACM
15 years 10 months ago
On providing location privacy for mobile sinks in wireless sensor networks
Wireless sensor networks have attracted increasing attentions considering their potentials for being widely adopted in both emerging civil and military applications. A common prac...
Edith C.-H. Ngai, Ioana Rodhe
WSC
1997
15 years 4 months ago
Selecting the Best System: A Decision-Theoretic Approach
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
Stephen E. Chick
136
Voted
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
15 years 8 months ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste