Sciweavers

664 search results - page 44 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
15 years 3 months ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens
ALIFE
2006
14 years 10 months ago
Through the Interaction of Neutral and Adaptive Mutations, Evolutionary Search Finds a Way
An evolutionary system that supports the interaction of neutral and adaptive mutations is investigated. Experimental results on a Boolean function and needle-in-haystack problems s...
Tina Yu, Julian Francis Miller
OOPSLA
2009
Springer
15 years 4 months ago
CZ: multiple inheritance without diamonds
Multiple inheritance has long been plagued with the “diamond” inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we ad...
Donna Malayeri, Jonathan Aldrich
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
15 years 10 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
ICASSP
2011
IEEE
14 years 1 months ago
Interference self-mitigating beamforming for the K-user MIMO IC
This work studies distributed linear transmission strategies for the multiple-input multiple-output (MIMO) interference channel with multiple concurrent links. We introduce the no...
Jianqi Wang, Amitav Mukherjee, A. Lee Swindlehurst