Sciweavers

2487 search results - page 112 / 498
» cases 2009
Sort
View
100
Voted
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 1 months ago
MaxMin allocation via degree lower-bounded arborescences
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...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
96
Voted
IPPS
2009
IEEE
15 years 7 months ago
Handling OS jitter on multicore multithreaded systems
Various studies have shown that OS jitter can degrade parallel program performance considerably at large processor counts. Most sources of system jitter fall broadly into 5 catego...
Pradipta De, Vijay Mann, Umang Mittaly
112
Voted
LATIN
2010
Springer
14 years 11 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
118
Voted
LFCS
2009
Springer
15 years 5 months ago
ATL with Strategy Contexts and Bounded Memory
We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the s...
Thomas Brihaye, Arnaud Da Costa Lopes, Franç...
COMPGEOM
2009
ACM
15 years 7 months ago
Straight skeletons of three-dimensional polyhedra
This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis...
Gill Barequet, Amir Vaxman