917 search results - page 31 / 184 » The Generalized Trace-Norm and its Application to Structure-... |
161
click to vote
DAM
2007
15 years 6 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
169
click to vote
GECCO
2007
Springer
16 years 9 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
203
click to vote
IUI
2004
ACM
15 years 11 months ago
2004
ACM
People are performing increasingly complicated actions on the web, such as automated purchases involving multiple sites. Things often go wrong, however, and it can be difficult to...
172
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
157
click to vote
PLDI
2010
ACM
16 years 3 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...