6562 search results - page 133 / 1313 » Noetherianity and Combination Problems |
139
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
155
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
188
click to vote
COLCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
Using a combination of machine learning probabilistic tools, we have shown that some chemistry students fail to develop productive problem solving strategies through practice alon...
130
click to vote
FSTTCS
2006
Springer
15 years 8 months ago
2006
Springer
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
137
click to vote
IJCAI
2003
15 years 6 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...