Sciweavers

5608 search results - page 699 / 1122
» On the Theory of Matchgate Computations
Sort
View
IPL
2006
104views more  IPL 2006»
15 years 6 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
JSYML
2008
108views more  JSYML 2008»
15 years 6 months ago
Randomness, lowness and degrees
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
George Barmpalias, Andrew E. M. Lewis, Mariya Ivan...
JUCS
2008
159views more  JUCS 2008»
15 years 6 months ago
Two Step Swarm Intelligence to Solve the Feature Selection Problem
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
Yudel Gómez, Rafael Bello, Amilkar Puris, M...
MP
2008
74views more  MP 2008»
15 years 6 months ago
On the symmetry function of a convex set
Abstract. We attempt a broad exploration of properties and connections between the symmetry function of a convex set S IRn and other arenas of convexity including convex functions...
Alexandre Belloni, Robert M. Freund
EOR
2007
95views more  EOR 2007»
15 years 6 months ago
A hybrid genetic algorithm for the two-dimensional single large object placement problem
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
Eleni Hadjiconstantinou, Manuel Iori