5316 search results - page 243 / 1064 » Which Search Problems Are Random |
138
click to vote
HICSS
1994
IEEE
15 years 8 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
137
click to vote
IEEEPACT
2006
IEEE
15 years 10 months ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
153
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
153
click to vote
CVPR
2011
IEEE
15 years 2 days ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
133
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...