Sciweavers

2974 search results - page 206 / 595
» Model-Driven Constraint Programming
Sort
View
OOPSLA
1991
Springer
15 years 10 months ago
Object-Oriented Type Inference
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...
Jens Palsberg, Michael I. Schwartzbach
ICML
2007
IEEE
16 years 7 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
CSB
2005
IEEE
118views Bioinformatics» more  CSB 2005»
16 years 3 days ago
Gene Teams with Relaxed Proximity Constraint
Functionally related genes co-evolve, probably due to the strong selection pressure in evolution. Thus we expect that they are present in multiple genomes. Physical proximity amon...
Sun Kim, Jeong-Hyeon Choi, Jiong Yang
ECAI
2004
Springer
15 years 12 months ago
Robust Solutions for Constraint Satisfaction and Optimization
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
CGO
2004
IEEE
15 years 10 months ago
Optimizing Translation Out of SSA Using Renaming Constraints
Static Single Assignment form is an intermediate representation that uses instructions to merge values at each confluent point of the control flow graph. instructions are not ma...
Fabrice Rastello, François de Ferriè...