Sciweavers

2725 search results - page 455 / 545
» Constraint Solving for Interpolation
Sort
View
FOCS
1992
IEEE
15 years 8 months ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
EVOW
2010
Springer
15 years 8 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
BIBE
2007
IEEE
159views Bioinformatics» more  BIBE 2007»
15 years 8 months ago
Non-negative Tensor Factorization Based on Alternating Large-scale Non-negativity-constrained Least Squares
Non-negative matrix factorization (NMF) and non-negative tensor factorization (NTF) have attracted much attention and have been successfully applied to numerous data analysis probl...
Hyunsoo Kim, Haesun Park, Lars Eldén
CASES
2007
ACM
15 years 8 months ago
Application driven embedded system design: a face recognition case study
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
Karthik Ramani, Al Davis
CCGRID
2007
IEEE
15 years 8 months ago
A Hybrid Linear Programming and Evolutionary Algorithm based Approach for On-line Resource Matching in Grid Environments
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
Pawel Garbacki, Vijay K. Naik