Sciweavers

2095 search results - page 336 / 419
» Improved pebbling bounds
Sort
View
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 2 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 2 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
ISPD
2000
ACM
126views Hardware» more  ISPD 2000»
14 years 2 months ago
A practical clock tree synthesis for semi-synchronous circuits
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...
Masahiko Toyonaga, Keiichi Kurokawa, Takuya Yasui,...
CONCUR
2000
Springer
14 years 2 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
PADS
1999
ACM
14 years 2 months ago
Performance Prediction Tools for Parallel Discrete-Event Simulation
We have developed a set of performance prediction tools which help to estimate the achievable speedups from parallelizing a sequential simulation. The tools focus on two important...
Chu-Cheow Lim, Yoke-Hean Low, Boon-Ping Gan, Sanja...