Sciweavers

363 search results - page 55 / 73
» Validation coverage analysis for complex digital designs
Sort
View
KBSE
2005
IEEE
14 years 2 months ago
Automating experimentation on distributed testbeds
Engineering distributed systems is a challenging activity. This is partly due to the intrinsic complexity of distributed systems, and partly due to the practical obstacles that de...
Yanyan Wang, Matthew J. Rutherford, Antonio Carzan...
SAC
2010
ACM
13 years 8 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
ICPR
2008
IEEE
14 years 3 months ago
Linear time recognition algorithms for topological invariants in 3D
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
Li Chen, Yongwu Rong
SETA
2004
Springer
79views Mathematics» more  SETA 2004»
14 years 2 months ago
A Survey of the Merit Factor Problem for Binary Sequences
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations ...
Jonathan Jedwab
OOPSLA
2004
Springer
14 years 2 months ago
Method-level phase behavior in java workloads
Java workloads are becoming more and more prominent on various computing devices. Understanding the behavior of a Java workload which includes the interaction between the applicat...
Andy Georges, Dries Buytaert, Lieven Eeckhout, Koe...