6251 search results - page 915 / 1251 » Randomness, Computability, and Density |
212
click to vote
EOR
2006
15 years 7 months ago
2006
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
202
click to vote
ENTCS
2007
15 years 7 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
208
click to vote
IPM
2007
15 years 7 months ago
2007
An information retrieval performance measure that is interpreted as the percent of perfect performance (PPP) can be used to study the effects of the inclusion of specific documen...
189
click to vote
IVC
2007
15 years 7 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
197
click to vote
AIEDAM
2000
15 years 7 months ago
2000
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...