Sciweavers

2397 search results - page 160 / 480
» Applications of integer relation algorithms
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 12 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
CORR
2010
Springer
179views Education» more  CORR 2010»
15 years 3 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
SCCC
2005
IEEE
16 years 1 days ago
Balancing active objects on a peer to peer infrastructure
We present a contribution on dynamic load balancing for distributed and parallel object-oriented applications. We specially target on peer to peer systems and its capability to di...
Javier Bustos-Jiménez, Denis Caromel, Alexa...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
GECCO
2000
Springer
15 years 10 months ago
Modeling GA Performance for Control Parameter Optimization
Optimization of the control parameters of genetic algorithms is often a time consuming and tedious task. In this work we take the meta-level genetic algorithm approach to control ...
Vincent A. Cicirello, Stephen F. Smith