1442 search results - page 256 / 289 » Finding interesting things |
107
click to vote
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
106
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
106
click to vote
FM
2006
Springer
15 years 3 months ago
2006
Springer
Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modelin...
111
click to vote
SOFSEM
2000
Springer
15 years 3 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
Particle swarm optimization (PSO) has been in practice for more than 10 years now and has gained wide popularity in various optimization tasks. In the context to single objective ...