Sciweavers

16504 search results - page 96 / 3301
» New Problems, New Solutions
Sort
View
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
15 years 11 months ago
New Epistasis Measures for Detecting Independently Optimizable Partitions of Variables
An optimization problem is often represented with a set of variables, and the interaction between the variables is referred to as epistasis. In this paper, we propose two new measu...
Dong-il Seo, Sung-Soon Choi, Byung Ro Moon
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
15 years 10 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
ECCV
2006
Springer
16 years 8 months ago
An Integral Solution to Surface Evolution PDEs Via Geo-cuts
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
Yuri Boykov, Vladimir Kolmogorov, Daniel Cremers, ...
ICCS
2009
Springer
15 years 4 months ago
Bending Virtual Spring-Damper: A Solution to Improve Local Platoon Control
This article presents a local control approach to linear vehicle platooning. Linear platoon systems are sets of vehicles that use local or global perception capabilities to form a ...
Jean-Michel Contet, Franck Gechter, Pablo Gruer, A...
AIR
2005
98views more  AIR 2005»
15 years 6 months ago
Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement
This paper studies the strategies for multi-objective optimization in a dynamic environment. In particular, we focus on problems with objective replacement, where some objectives ...
Sheng Uei Guan, Qian Chen, Wenting Mo