Sciweavers

4432 search results - page 435 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
16 years 11 months ago
Fast Normalized Cut with Linear Constraints
Normalized Cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be ap...
Linli Xu (University of Alberta), Wenye Li (Univer...
CC
2005
Springer
115views System Software» more  CC 2005»
15 years 10 months ago
Experiences with Enumeration of Integer Projections of Parametric Polytopes
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
Sven Verdoolaege, Kristof Beyls, Maurice Bruynoogh...
GECCO
2005
Springer
15 years 10 months ago
Evolving agent swarms for clustering and sorting
Social insect societies consist of individuals with simple behavior, yet at the collective level the societies are capable of solving complex tasks. These tasks span a wide range,...
Vegard Hartmann
CPAIOR
2004
Springer
15 years 9 months ago
Stabilization Issues for Constraint Programming Based Column Generation
Abstract. Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming (CP) to solve column generation subpr...
Louis-Martin Rousseau
SAT
2004
Springer
113views Hardware» more  SAT 2004»
15 years 9 months ago
Clause Form Conversions for Boolean Circuits
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
Paul Jackson, Daniel Sheridan