Sciweavers

510 search results - page 37 / 102
» How Should We Solve Search Problems Privately
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Allocation of local and global search capabilities of particle in canonical PSO
This paper analyzes theoretically the exact sampling distribution of the particle swarm optimization (PSO) without any assumption imposed by all current analyses. The distribution...
Junqi Zhang, Kun Liu, Ying Tan, Xingui He
CP
2009
Springer
13 years 5 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
SIAMIS
2010
171views more  SIAMIS 2010»
13 years 2 months ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...
SECURWARE
2008
IEEE
14 years 1 months ago
Polynomial Heuristic Algorithms for Inconsistency Characterization in Firewall Rule Sets
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...
AAAI
2010
13 years 9 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap