11345 search results - page 2029 / 2269 » Foundations of Computer Science |
126
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
125
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
153
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
122
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
134
click to vote
ICFEM
2003
Springer
15 years 8 months ago
2003
Springer
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...