Sciweavers

2157 search results - page 257 / 432
» Binary ant algorithm
Sort
View
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 6 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
157
Voted
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
15 years 6 months ago
Approximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
Tor Arne Johansen
PRL
1998
142views more  PRL 1998»
15 years 6 months ago
A monothetic clustering method
: The proposed divisive clustering method performs simultaneously a hierarchy of a set of objects and a monothetic characterization of each cluster of the hierarchy. A division is ...
Marie Chavent
BIOADIT
2004
Springer
15 years 11 months ago
Searching for a Practical Evidence of the No Free Lunch Theorems
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
Mihai Oltean
PEPM
2010
ACM
16 years 3 months ago
Context-sensitive analysis of obfuscated x86 executables
A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipul...
Arun Lakhotia, Davidson R. Boccardo, Anshuman Sing...