Sciweavers

ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
13 years 9 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
CEC
2003
IEEE
13 years 9 months ago
Improving migration by diversity
We present an improvement to distributed GAs based on migration of individuals between several concurrently evolving populations. The idea behind our improvement is to not only use...
Jörg Denzinger, Jordan Kidney
ISNN
2005
Springer
13 years 10 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
WIOPT
2005
IEEE
13 years 10 months ago
Iterated Local Optimization for Minimum Energy Broadcast
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
Intae Kang, Radha Poovendran
ICRA
2005
IEEE
117views Robotics» more  ICRA 2005»
13 years 10 months ago
Optimal Positioning Strategies for Shape Changes in Robot Teams
Abstract— In this paper, we consider the task of repositioning a formation of robots to a new shape while minimizing either the maximum distance that any robot travels, or the to...
John R. Spletzer, Rafael B. Fierro
WEA
2007
Springer
87views Algorithms» more  WEA 2007»
13 years 10 months ago
Algorithms for Longer OLED Lifetime
Abstract. We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing ...
Friedrich Eisenbrand, Andreas Karrenbauer, Chihao ...
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
13 years 10 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
13 years 10 months ago
Optimal antenna placement using a new multi-objective chc algorithm
Radio network design (RND) is a fundamental problem in cellular networks for telecommunications. In these networks, the terrain must be covered by a set of base stations (or anten...
Antonio J. Nebro, Enrique Alba, Guillermo Molina, ...
CSCLP
2007
Springer
13 years 10 months ago
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
Krzysztof R. Apt, Francesca Rossi, Kristen Brent V...
CC
2007
Springer
107views System Software» more  CC 2007»
13 years 10 months ago
A Fast Cutting-Plane Algorithm for Optimal Coalescing
Abstract. Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorith...
Daniel Grund, Sebastian Hack