2725 search results - page 236 / 545 » Constraint Solving for Interpolation |
202
click to vote
AIMSA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
221
click to vote
CONSTRAINTS
2007
15 years 7 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
213
click to vote
TWC
2008
15 years 7 months ago
2008
Abstract--We investigate the dynamic spectrum sharing problem among primary and secondary users in a cognitive radio network. We consider the scenario where primary users exhibit o...
163
click to vote
BCSHCI
2007
15 years 8 months ago
2007
The Creative Problem-Solving Research Group (CPSRG) at Lancaster University is a collaboration between psychologists and computer scientists conducting research into creativity, p...
183
click to vote
AAAI
2006
15 years 8 months ago
2006
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...