JAR 2011
 |  |
Wall of Fame | Most Viewed JAR-2011 Paper
JAR
2011
13 years 7 months ago
2011
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 112 | ||
| 2 | | 63 | ||
| 3 | | 60 | ||
| 4 | | 50 | ||
| 5 | | 49 |