Sciweavers

1133 search results - page 42 / 227
» Best Practices in e-Assessment
Sort
View
IPPS
2005
IEEE
15 years 12 months ago
Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel a...
Holger Blaar, Thomas Lange, Renate Winter, Marcel ...
CP
2005
Springer
15 years 11 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
CRYPTO
2003
Springer
127views Cryptology» more  CRYPTO 2003»
15 years 11 months ago
Cryptanalysis of SAFER++
This paper presents several multiset and boomerang attacks on Safer++ up to 5.5 out of its 7 rounds. These are the best known attacks for this cipher and significantly improve the...
Alex Biryukov, Christophe De Cannière, Gust...
COMPSAC
2002
IEEE
15 years 11 months ago
Tool Support for Distributed Inspection
Software inspection is one of the best practices for detecting and removing defects early in the software development process. We present a tool to support geographically distribu...
Filippo Lanubile, Teresa Mallardo
WMTE
2002
IEEE
15 years 11 months ago
Mobile Internet Usability: What Can 'Mobile Learning' Learn from the Past?
‘Mobile Learning’ is a type of application/service that generally presumes to use mobile Internet technology for learning purposes. This paper focuses on discussing basic usab...
Maria Uther