Sciweavers

217 search results - page 20 / 44
» Backdoors To Typical Case Complexity
Sort
View
CEC
2007
IEEE
15 years 5 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
BPM
2008
Springer
192views Business» more  BPM 2008»
15 years 1 months ago
Trace Clustering in Process Mining
Process mining has proven to be a valuable tool for analyzing operational process executions based on event logs. Existing techniques perform well on structured processes, but stil...
Minseok Song, Christian W. Günther, Wil M. P....
ECAI
2010
Springer
15 years 6 days ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes
107
Voted
JSAC
2006
81views more  JSAC 2006»
14 years 11 months ago
Fast linearized energy allocation for multimedia loading on multicarrier systems
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...
Michael A. Enright, C. C. Jay Kuo
TIT
1998
69views more  TIT 1998»
14 years 10 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.