179 search results - page 29 / 36 » On Perfect Codes and Related Concepts |
103
click to vote
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
AOSE
2007
Springer
15 years 4 months ago
2007
Springer
This paper describes the Organization-based Multiagent System Engineering (O-MaSE) Process Framework, which helps process engineers define custom multiagent systems development pr...
CASC
2007
Springer
15 years 4 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
OOPSLA
2004
Springer
15 years 3 months ago
2004
Springer
This demonstration will feature overviews of the C-SAW and GenAWeave projects. The first half of the presentation will introduce the concept of two-level aspect weaving, which uni...
ECRTS
2002
IEEE
15 years 2 months ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...