5090 search results - page 491 / 1018 » Constructing Strategies for Programming |
273
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Traditional approaches to rule-based information extraction (IE) have primarily been based on regular expression grammars. However, these grammar-based systems have difficulty scal...
199
click to vote
ICML
2008
IEEE
16 years 7 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...
260
click to vote
ICLP
2009
Springer
16 years 7 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 ...
172
Voted
SPAA
2009
ACM
16 years 7 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),...
200
click to vote
IWOMP
2009
Springer
16 years 1 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...