Sciweavers

79 search results - page 16 / 16
» On the Relaxation of n-detect Test Sets
Sort
View
TPHOL
2009
IEEE
14 years 4 months ago
A Better x86 Memory Model: x86-TSO
Abstract. Real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory mode...
Scott Owens, Susmit Sarkar, Peter Sewell
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 3 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 2 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
CEC
2010
IEEE
13 years 11 months ago
Many-objective Distinct Candidates Optimization using Differential Evolution on centrifugal pump design problems
Many-objective problems are difficult to solve using conventional multi-objective evolutionary algorithms (MOEAs) as these algorithms rely primarily on Pareto ranking to guide the ...
Peter Dueholm Justesen, Rasmus K. Ursem