Sciweavers

393 search results - page 62 / 79
» Personnel scheduling: Models and complexity
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 2 days ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
JFP
2000
91views more  JFP 2000»
14 years 11 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
BMCBI
2008
122views more  BMCBI 2008»
14 years 12 months ago
High-throughput bioinformatics with the Cyrille2 pipeline system
Background: Modern omics research involves the application of high-throughput technologies that generate vast volumes of data. These data need to be pre-processed, analyzed and in...
Mark W. E. J. Fiers, Ate van der Burgt, Erwin Date...
89
Voted
IPSN
2007
Springer
15 years 6 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
MABS
1998
Springer
15 years 4 months ago
ABCDE: Agent Based Chaotic Dynamic Emergence
This paper concerns agent based experiments in the field of negotiation and exchange simulation. A computer simulation environment is built, showing the emergence of chaotic price ...
Pietro Terna