43 search results - page 8 / 9 » The Complexity of the Covering Radius Problem on Lattices an... |
FOCS
1995
IEEE
13 years 9 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
SIAMCOMP
1998
13 years 5 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
ECOOP
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Aspect-oriented programming (AOP) has produced interesting language designs, but also ad hoc semantics that needs clarification. We contribute to this clarification wit...
VAMOS
2010
Springer
13 years 7 months ago
2010
Springer
Feature models are a common way to represent variability in software product line engineering. For this purpose, most authors use a graphical notation based on FODA. The main drawb...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
White-box testing is an important method for the early detection of errors during software development. In this process test case generation plays a crucial role, defining appropr...