3136 search results - page 101 / 628 » Complex networks and evolutionary computation |
115
click to vote
MOBIHOC
2006
ACM
16 years 1 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
68
Voted
AINA
2007
IEEE
2007
IEEE
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
15 years 7 months ago
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
104
click to vote
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
125
click to vote
GECCO
2011
Springer
14 years 5 months ago
2011
Springer
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
135
Voted
PERCOM
2004
ACM
16 years 1 months ago
2004
ACM
We explore the challenges and research directions in building models, protocols and architectures to support security in pervasive computing environments. We argue that to be succ...