4131 search results - page 91 / 827 » Compactness in Topology and Computation |
163
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
136
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We consider metrical task systems, a general framework to model online problems. Borodin, Linial and Saks [BLS92] presented a deterministic work function algorithm (WFA) for metric...
169
click to vote
GD
2009
Springer
15 years 9 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
192
click to vote
NSDI
2010
15 years 7 months ago
2010
Operators of data centers want a scalable network fabric that supports high bisection bandwidth and host mobility, but which costs very little to purchase and administer. Ethernet...
163
click to vote
MOBIHOC
2009
ACM
16 years 6 months ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...