6562 search results - page 263 / 1313 » Noetherianity and Combination Problems |
150
click to vote
AAAI
1990
15 years 7 months ago
1990
We describe a program, BEATRIX, that can understand textbook physics problems specified by a combination of English text and a diagram. The result of the understanding process is ...
167
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
167
click to vote
IANDC
2008
15 years 6 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
176
click to vote
JAIR
2006
15 years 6 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
116
click to vote
JPDC
2006
15 years 6 months ago
2006
This paper deals with the study of the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of messa...