1569 search results - page 160 / 314 » Programming contest strategy |
111
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
172
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
98
Voted
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
117
click to vote
IWOMP
2009
Springer
15 years 7 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
113
Voted
ICDIM
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we propose a strategy for the automated and scheduled maintenance of a digital library collection. Existing systems require the user either to add new data manually...