16596 search results - page 243 / 3320 » Generalized Assignment Problems |
207
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
200
click to vote
AOR
2010
15 years 4 months ago
2010
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
221
Voted
SIAMCOMP
2012
13 years 9 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
175
click to vote
PASTE
2004
ACM
16 years 3 days ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
174
click to vote
COLT
2005
Springer
16 years 6 days ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...