Sciweavers

3838 search results - page 536 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
CIKM
2004
Springer
15 years 9 months ago
Evaluating window joins over punctuated streams
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
Luping Ding, Elke A. Rundensteiner
EMSOFT
2004
Springer
15 years 9 months ago
An approach for integrating basic retiming and software pipelining
Basic retiming is an algorithm originally developed for hardware optimization. Software pipelining is a technique proposed to increase instruction-level parallelism for parallel p...
Noureddine Chabini, Wayne Wolf
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
15 years 9 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
GECCO
2004
Springer
115views Optimization» more  GECCO 2004»
15 years 9 months ago
Parameter-Less Hierarchical BOA
Abstract. The parameter-less hierarchical Bayesian optimization algorithm (hBOA) enables the use of hBOA without the need for tuning parameters for solving each problem instance. T...
Martin Pelikan, Tz-Kai Lin
140
Voted
DAC
2003
ACM
15 years 9 months ago
Fast timing-driven partitioning-based placement for island style FPGAs
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
Pongstorn Maidee, Cristinel Ababei, Kia Bazargan