Sciweavers

6562 search results - page 109 / 1313
» Noetherianity and Combination Problems
Sort
View
JPDC
1998
125views more  JPDC 1998»
15 years 4 months ago
Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM
Programlibraries are one tool to make the cooperation between specialists from various elds successful: the separation of application-speci c knowledge from applicationindependent...
Adrian Brüngger, Ambros Marzetta, Jens Clause...
IPL
2010
80views more  IPL 2010»
15 years 3 months ago
The reachability problem for branching vector addition systems requires doubly-exponential space
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
Ranko Lazic
ICPR
2006
IEEE
16 years 5 months ago
A Global Solution to the SFS Problem Using B-spline Surface and Simulated Annealing
This paper restates the shape from shading problem regarding both surface modeling and optimization. We combine the use of a B-spline as 3D model for the scene surface and the use...
Frédéric Courteille, Jean-Denis Duro...
ISDA
2009
IEEE
15 years 11 months ago
Clustering-Based Feature Selection in Semi-supervised Problems
— In this contribution a feature selection method in semi-supervised problems is proposed. This method selects variables using a feature clustering strategy, using a combination ...
Ianisse Quinzán, José Manuel Sotoca,...
IPPS
2007
IEEE
15 years 11 months ago
A hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem
This work presents a new hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem (DRCTSP). The most important differences between the new EA and...
André Renato Villela da Silva, Luiz Satoru ...