Sciweavers

1019 search results - page 51 / 204
» Uniform Functors on Sets
Sort
View
IANDC
2008
80views more  IANDC 2008»
13 years 7 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
DM
2006
91views more  DM 2006»
13 years 7 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
JUCS
2002
81views more  JUCS 2002»
13 years 7 months ago
Membrane Computing: The Power of (Rule) Creation
: We consider a uniform way of treating objects and rules in P systems: we start with multisets of rules, which are consumed when they are applied, but the application of a rule ma...
Fernando Arroyo, Angel V. Baranda, Juan Castellano...
RSA
2008
84views more  RSA 2008»
13 years 7 months ago
Random partitions with restricted part sizes
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
William M. Y. Goh, Pawel Hitczenko
WDAG
2010
Springer
158views Algorithms» more  WDAG 2010»
13 years 6 months ago
Distributed Contention Resolution in Wireless Networks
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
Thomas Kesselheim, Berthold Vöcking