Sciweavers

952 search results - page 116 / 191
» Computational complexity of stochastic programming problems
Sort
View
EUROPAR
2004
Springer
15 years 8 months ago
More Legal Transformations for Locality
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
Cédric Bastoul, Paul Feautrier
UPP
2004
Springer
15 years 8 months ago
Grassroots Approach to Self-management in Large-Scale Distributed Systems
Abstract. Traditionally, autonomic computing is envisioned as replacing the human factor in the deployment, administration and maintenance of computer systems that are ever more co...
Özalp Babaoglu, Márk Jelasity, Alberto...
SAS
2001
Springer
15 years 7 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 3 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
CVPR
2008
IEEE
15 years 9 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie