Sciweavers

16404 search results - page 869 / 3281
» A set coverage problem
Sort
View
ASPDAC
1999
ACM
132views Hardware» more  ASPDAC 1999»
15 years 12 months ago
Faster and Better Spectral Algorithms for Multi-Way Partitioning
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
Jan-Yang Chang, Yu-Chen Liu, Ting-Chi Wang
ECOOP
1998
Springer
15 years 12 months ago
The Complexity of Type Analysis of Object Oriented Programs
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
Joseph Gil, Alon Itai
FOCS
2004
IEEE
15 years 11 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
15 years 11 months ago
A comparative study of differential evolution variants for global optimization
In this paper, we present an empirical comparison of some Differential Evolution variants to solve global optimization problems. The aim is to identify which one of them is more s...
Efrén Mezura-Montes, Jesús Vel&aacut...
AIPS
2007
15 years 10 months ago
Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
Raghav Aras, Alain Dutech, François Charpil...