Sciweavers

12015 search results - page 525 / 2403
» Interactive Algorithms 2005
Sort
View
138
Voted
DAC
2005
ACM
15 years 7 months ago
Faster and better global placement by a new transportation algorithm
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
Ulrich Brenner, Markus Struzyna
IJCAI
2007
15 years 6 months ago
Adaptive Genetic Algorithm with Mutation and Crossover Matrices
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the se...
Nga Lam Law, Kwok Yip Szeto
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 6 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
159
Voted
JPDC
2006
106views more  JPDC 2006»
15 years 5 months ago
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
Matthias Scheutz, Paul W. Schermerhorn
118
Voted
AMC
2005
138views more  AMC 2005»
15 years 5 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa