Sciweavers

975 search results - page 143 / 195
» Locality Optimization for Program Instances
Sort
View
AAAI
2010
13 years 10 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
COR
2010
155views more  COR 2010»
13 years 9 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
ENTCS
2008
70views more  ENTCS 2008»
13 years 9 months ago
Separate Compilation of Polychronous Specifications
As code generation for synchronous programs requires strong safety properties to be satisfied, compositionality becomes a difficult goal to achieve. Most synchronous languages, su...
Julien Ouy, Jean-Pierre Talpin, Loïc Besnard,...
SCP
2010
78views more  SCP 2010»
13 years 7 months ago
Scoping strategies for distributed aspects
Dynamic deployment of aspects brings greater flexibility and reuse potential, but requires a proper means for scoping aspects. Scoping issues are particularly crucial in a distri...
Éric Tanter, Johan Fabry, Rémi Douen...
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
13 years 7 months ago
Learning an Affine Transformation for Non-linear Dimensionality Reduction
The foremost nonlinear dimensionality reduction algorithms provide an embedding only for the given training data, with no straightforward extension for test points. This shortcomin...
Pooyan Khajehpour Tadavani, Ali Ghodsi