Sciweavers

811 search results - page 98 / 163
» Avoiding Approximate Squares
Sort
View
COCOON
2007
Springer
14 years 3 months ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
14 years 3 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon
HICSS
2006
IEEE
118views Biometrics» more  HICSS 2006»
14 years 3 months ago
An Estimator of Propagation of Cascading Failure
— We suggest a statistical estimator to measure the extent to which failures propagate in cascading failures such as large blackouts. The estimator is tested on a saturating bran...
Ian Dobson, Kevin R. Wierzbicki, Benjamin A. Carre...
ICPR
2006
IEEE
14 years 3 months ago
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
In this paper, we address the pre-image problem in kernel principal component analysis (KPCA). The preimage problem finds a pattern as the pre-image of a feature vector defined in...
Weishi Zheng, Jian-Huang Lai
ICRA
2006
IEEE
217views Robotics» more  ICRA 2006»
14 years 3 months ago
Complete Coverage Control for Nonholonomic Mobile Robots in Dynamic Environments
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
Yi Guo, Mohanakrishnan Balakrishnan