1552 search results - page 254 / 311 » Concepts and Concept-Oriented Programming |
178
click to vote
SIGMOD
2009
ACM
16 years 24 days ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
159
click to vote
ICALP
2009
Springer
16 years 24 days ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
195
click to vote
ICS
2009
Tsinghua U.
16 years 23 days ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
180
click to vote
ICS
2009
Tsinghua U.
16 years 23 days ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
191
click to vote
CGO
2008
IEEE
16 years 14 days ago
2008
IEEE
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...