Sciweavers

956 search results - page 55 / 192
» Slicing Objects Using System Dependence Graphs
Sort
View
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
15 years 2 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
ECAI
2004
Springer
15 years 10 months ago
Attention-Driven Parts-Based Object Detection
Recent studies have argued that natural vision systems perform classification by utilizing different mechanisms depending on the visual input. In this paper we present a hybrid, ...
Ilkka Autio, Jussi T. Lindgren
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 6 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
154
Voted
EPS
1998
Springer
15 years 8 months ago
Variable-Dimensional Optimization with Evolutionary Algorithms Using Fixed-Length Representations
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
Joachim Sprave, Susanne Rolf
CP
2007
Springer
15 years 10 months ago
Scheduling Conditional Task Graphs
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
Michele Lombardi, Michela Milano