3907 search results - page 456 / 782 » Time, Knowledge, and Choice |
201
Voted
SGAI
2004
Springer
16 years 3 days ago
2004
Springer
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
165
click to vote
WAOA
2004
Springer
16 years 3 days ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
194
click to vote
WLP
2004
Springer
16 years 3 days ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
160
click to vote
IEEEPACT
2003
IEEE
16 years 1 days ago
2003
IEEE
This paper describes Compiler-Directed Content-Aware Prefetching (CDCAP), an integrated compiler and hardware approach for prefetching dynamic data structures. The approach utiliz...
176
click to vote
KCAP
2003
ACM
16 years 20 hour ago
2003
ACM
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...