Sciweavers

15635 search results - page 2737 / 3127
» A Designing Model of XML-Dataweb
Sort
View
AFRICACRYPT
2008
Springer
15 years 6 months ago
How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
Jean-Philippe Aumasson, Raphael C.-W. Phan
AISB
2008
Springer
15 years 6 months ago
The Plaited Structure of Time in Information Technology
Abstract. The aim of this paper is to try to understand the structure of time in information technologies. Starting with historical arguments, it first shows that time is neither l...
Jean-Gabriel Ganascia
ANNPR
2008
Springer
15 years 6 months ago
Combining Methods for Dynamic Multiple Classifier Systems
Most of what we know about multiple classifier systems is based on empirical findings, rather than theoretical results. Although there exist some theoretical results for simple and...
Amber Tomas
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 6 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ARCS
2008
Springer
15 years 6 months ago
How Efficient are Creatures with Time-shuffled Behaviors?
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...
Patrick Ediger, Rolf Hoffmann, Mathias Halbach
« Prev « First page 2737 / 3127 Last » Next »