Sciweavers

3898 search results - page 53 / 780
» On the Bit Extraction Problem
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 11 months ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi
FOCS
1999
IEEE
15 years 2 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
SWSTE
2005
IEEE
15 years 3 months ago
Mapping Structures for Flash Memories: Techniques and Open Problems
Flash memory is a type of electrically erasable programmable read-only memory (EEPROM). Because flash memories are nonvolatile and relatively dense, they are now used to store ï¬...
Eran Gal, Sivan Toledo
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
14 years 11 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
FLAIRS
2007
15 years 5 days ago
An Extended Neural Gas Model for Efficient Data Mining Tasks
This paper presents a numerical association rule extraction method that is based on original quality measures which evaluate to what extent a numerical classification model behave...
Jean-Charles Lamirel, Shadi Al Shehabi