380 search results - page 6 / 76 » Generalizing foraging theory for analysis and design |
SIGDOC
2003
ACM
15 years 2 months ago
2003
ACM
In this paper, I discuss how we made single-sourcing work at Juniper Networks. This is a practical discussion of issues, problems, and successes. Categories and Subject Descriptor...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
113
click to vote
FOGA
2011
14 years 27 days ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
107
click to vote
SIGSOFT
2003
ACM
15 years 10 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
PDC
2004
ACM
15 years 2 months ago
2004
ACM
As computer technologies start to permeate the everyday activities of a continuously growing population, social and technical as well as political and legal issues will surface. P...