154 search results - page 14 / 31 » Algorithms for Implicit Hitting Set Problems |
DLOG
2010
14 years 7 months ago
2010
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on co...
82
Voted
ADG
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
VLDB
2001
ACM
15 years 1 months ago
2001
ACM
Dynamically generated web pages are ubiquitous today but their high demand for resources creates a huge scalability problem at the servers. Traditional web caching is not able to ...
ICPPW
2002
IEEE
15 years 2 months ago
2002
IEEE
generally meta-data, so that documents on any specific subject can be transparently retrieved. While quality control can in principle still rely on the traditional methods of peer-...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...