Abstract. Current data-intensive Web applications, such as on-line trading, ecommerce, corporate portals and so on, are becoming more and more complex, both in terms of density of ...
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
— In previous work we presented a multi-robot strategy for routing missions in large scenarios where network connectivity must be explicitly preserved. This strategy is founded o...
A distributed problem solving approach to job shop scheduling is described in this paper. The approach views the system as an Organisation. Agents are assigned di erent roles and ...
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...