2080 search results - page 309 / 416 » Measuring empirical computational complexity |
163
click to vote
DRM
2007
Springer
16 years 15 days ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
172
click to vote
SENSYS
2006
ACM
16 years 8 days ago
2006
ACM
Extensive empirical studies presented in this paper confirm that the quality of radio communication between low power sensor devices varies significantly with time and environme...
184
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
161
click to vote
ILP
2004
Springer
15 years 11 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
156
click to vote
CPE
1998
Springer
15 years 10 months ago
1998
Springer
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve ord...