Sciweavers

867 search results - page 99 / 174
» An Evolutionary Algorithm for Integer Programming
Sort
View
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 3 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
GLOBECOM
2009
IEEE
15 years 9 months ago
Strong Barrier Coverage with Directional Sensors
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
Li Zhang, Jian Tang, Weiyi Zhang
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
15 years 7 months ago
Lower-bound estimation for multi-bitwidth scheduling
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
Junjuan Xu, Jason Cong, Xu Cheng
IPPS
1998
IEEE
15 years 6 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
ANOR
2007
166views more  ANOR 2007»
15 years 2 months ago
Memetic particle swarm optimization
Abstract We propose a new Memetic Particle Swarm Optimization scheme that incorporates local search techniques in the standard Particle Swarm Optimization algorithm, resulting in a...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...