Sciweavers

728 search results - page 139 / 146
» Compressing combinatorial objects
Sort
View
FLAIRS
2004
13 years 8 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
CGF
2006
191views more  CGF 2006»
13 years 7 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
EOR
2006
148views more  EOR 2006»
13 years 7 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
IJFCS
2008
102views more  IJFCS 2008»
13 years 7 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
IJCV
2006
121views more  IJCV 2006»
13 years 7 months ago
Feature-Based Sequence-to-Sequence Matching
This paper studies the problem of matching two unsynchronized video sequences of the same dynamic scene, recorded by different stationary uncalibrated video cameras. The matching i...
Yaron Caspi, Denis Simakov, Michal Irani