Sciweavers

1977 search results - page 222 / 396
» The satisfactory partition problem
Sort
View
IWPEC
2009
Springer
15 years 11 months ago
Even Faster Algorithm for Set Splitting!
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
Daniel Lokshtanov, Saket Saurabh
IAT
2008
IEEE
15 years 11 months ago
An Improved Discrete Particle Swarm Optimization Based on Cooperative Swarms
The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an i...
Yiheng Xu, Qiangwei Wang, Jinglu Hu
IAT
2007
IEEE
15 years 10 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
EMMCVPR
2007
Springer
15 years 10 months ago
Bayesian Order-Adaptive Clustering for Video Segmentation
Video segmentation requires the partitioning of a series of images into groups that are both spatially coherent and smooth along the time axis. We formulate segmentation as a Bayes...
Peter Orbanz, Samuel Braendle, Joachim M. Buhmann
ACSAC
2006
IEEE
15 years 10 months ago
Covert and Side Channels Due to Processor Architecture
Information leakage through covert channels and side channels is becoming a serious problem, especially when these are enhanced by modern processor architecture features. We show ...
Zhenghong Wang, Ruby B. Lee