Sciweavers

2681 search results - page 174 / 537
» Problem F
Sort
View
INFOCOM
1997
IEEE
14 years 2 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
14 years 2 months ago
Adaptive evolution: an efficient heuristic for global optimization
This paper presents a novel evolutionary approach to solve numerical optimization problems, called Adaptive Evolution (AEv). AEv is a new micro-population-like technique because i...
Francisco Viveros Jiménez, Efrén Mez...
FCT
1993
Springer
14 years 2 months ago
Generalized Topological Sorting in Linear Time
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
Torben Hagerup, Martin Maas
SCP
1998
113views more  SCP 1998»
13 years 10 months ago
Linear-Time Hierarchies for a Functional Language Machine Model
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
Eva Rose
ICIP
2007
IEEE
15 years 13 days ago
Active Contours Based on Chambolle's Mean Curvature Motion
This paper proposes an algorithm to solve most of existing active contour problems based on the approach of mean curvature motion proposed by Chambolle in [1] and the image denois...
Xavier Bresson, Tony F. Chan