Sciweavers

1265 search results - page 153 / 253
» Finding the Key to a Synapse
Sort
View
USENIX
2000
13 years 10 months ago
Towards Availability Benchmarks: A Case Study of Software RAID Systems
Benchmarks have historically played a key role in guiding the progress of computer science systems research and development, but have traditionally neglected the areas of availabi...
Aaron B. Brown, David A. Patterson
SEBD
1996
94views Database» more  SEBD 1996»
13 years 10 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
CEC
2010
IEEE
13 years 10 months ago
A hybrid genetic algorithm and inver over approach for the travelling salesman problem
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
Shakeel Arshad, Shengxiang Yang
CHES
2010
Springer
210views Cryptology» more  CHES 2010»
13 years 10 months ago
Flash Memory 'Bumping' Attacks
This paper introduces a new class of optical fault injection attacks called bumping attacks. These attacks are aimed at data extraction from secure embedded memory, which usually s...
Sergei Skorobogatov
COLOGNETWENTE
2009
13 years 10 months ago
Acyclic and Frugal Colourings of Graphs
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
Ross J. Kang, Tobias Müller