Sciweavers

3422 search results - page 672 / 685
» Random Subset Optimization
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 1 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 1 months ago
Window-Based Greedy Contention Management for Transactional Memory
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....
Gokarna Sharma, Brett Estrade, Costas Busch
COMCOM
2008
145views more  COMCOM 2008»
15 years 1 months ago
A game-theoretic intrusion detection model for mobile ad hoc networks
In this paper, we address the problem of increasing the effectiveness of an intrusion detection system (IDS) for a cluster of nodes in ad hoc networks. To reduce the performance o...
Hadi Otrok, Noman Mohammed, Lingyu Wang, Mourad De...
CORR
2008
Springer
150views Education» more  CORR 2008»
15 years 1 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot
112
Voted
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 1 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov