2835 search results - page 410 / 567 » Automatic Question Answering |
143
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](http://sciweavers.com/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
178
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
170
click to vote
ICADL
2007
Springer
15 years 8 months ago
2007
Springer
Digitizing ancient books, especially those related to the humanities, is practiced in many countries. The number of full-text databases in the humanities is increasing. Studies hav...
143
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
179
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...