Sciweavers

16404 search results - page 705 / 3281
» A set coverage problem
Sort
View
FLAIRS
2006
15 years 8 months ago
Full Restart Speeds Learning
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
Smiljana Petrovic, Susan L. Epstein
CEC
2010
IEEE
15 years 7 months ago
The differential Ant-Stigmergy Algorithm for large-scale global optimization
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
Peter Korosec, Katerina Taskova, Jurij Silc
RECOMB
2010
Springer
15 years 5 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...
LATA
2012
Springer
14 years 2 months ago
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
Arne Meier, Johannes Schmidt, Michael Thomas, Heri...
CVPR
2004
IEEE
16 years 9 months ago
Reconstructing Open Surfaces from Unorganized Data Points
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
Jan Erik Solem, Anders Heyden