Sciweavers

4131 search results - page 241 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
CCCG
1994
15 years 5 months ago
Widest Empty Corridor with Multiple Links and Right-angle Turns
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
Siu-Wing Cheng
CAI
2006
Springer
15 years 4 months ago
Symbolic Explanation of Similarities in Case-based Reasoning
CBR systems solve problems by assessing their similarity with already solved problems (cases). Explanation of a CBR system prediction usually consists of showing the user the set o...
Eva Armengol, Enric Plaza
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 10 months ago
An extended mutation concept for the local selection based differential evolution algorithm
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Jani Rönkkönen, Jouni Lampinen

Publication
445views
17 years 13 days ago
Computational Study of Fast Methods For The Eikonal Equation
"A computational study of the Fast Marching and the Fast Sweeping methods for the Eikonal equation is given. It is shown that even though Fast Sweeping requires asymptotically...
Pierre A. Gremaud and Christopher M. Kuster