784 search results - page 10 / 157 » Relaxing the Value Restriction |
IPCO
1992
13 years 9 months ago
1992
We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
PLDI
2011
ACM
12 years 10 months ago
2011
ACM
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
ER
2008
Springer
13 years 9 months ago
2008
Springer
The capability to dynamically evolve process models over time and to migrate process instances to a modified model version are fundamental requirements for any process-aware inform...
SPAA
2003
ACM
14 years 29 days ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...