Sciweavers

2126 search results - page 236 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
CEC
2008
IEEE
16 years 29 days ago
A study on constrained MA using GA and SQP: Analytical vs. finite-difference gradients
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
PAMI
2007
176views more  PAMI 2007»
15 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
PODS
2008
ACM
159views Database» more  PODS 2008»
16 years 6 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 11 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
INFORMATICALT
2002
91views more  INFORMATICALT 2002»
15 years 6 months ago
Bayesian Heuristic Approach to Scheduling
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
Jonas Mockus