144 search results - page 26 / 29 » New approaches to covering and packing problems |
103
click to vote
FOCS
1995
IEEE
15 years 1 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
14 years 9 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...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
TAMODIA
2007
14 years 10 months ago
2007
Abstract. Covering quality aspects such as usability through the software development life cycle is challenging. These “-ilities” are generally difficult to grasp and usually ...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...