56 search results - page 10 / 12 » Local Branching in a Constraint Programming Framework |
139
click to vote
SIGGRAPH
1992
ACM
15 years 6 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
136
Voted
IPCCC
1999
IEEE
15 years 6 months ago
1999
IEEE
Performance evaluation of modern, highly speculative, out-of-order microprocessors and the corresponding production of detailed, valid, accurate results have become serious challe...
115
Voted
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
131
click to vote
WLP
1997
Springer
15 years 6 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
140
Voted
AI
2010
Springer
15 years 2 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...