Sciweavers

800 search results - page 152 / 160
» Effective Prediction and its Computational Complexity
Sort
View
EMSOFT
2004
Springer
15 years 5 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
COLCOM
2009
IEEE
15 years 4 months ago
An analytical study of GWAP-based geospatial tagging systems
—Geospatial tagging (geotagging) is an emerging and very promising application that can help users find a wide variety of location-specific information, and facilitate the deve...
Ling-Jyh Chen, Yu-Song Syu, Bo-Chun Wang, Wang-Chi...
119
Voted
AAAI
2000
15 years 1 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
JSA
2000
115views more  JSA 2000»
14 years 11 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 6 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng