728 search results - page 42 / 146 » Efficient Searching with Linear Constraints |
167
click to vote
MTV
2005
IEEE
15 years 11 months ago
2005
IEEE
Our mutation based validation paradigm (MVP) is a validation environment for high-level microprocessor implementations. To be able to efficiently identify and analyze the architec...
154
click to vote
COR
2010
15 years 6 months ago
2010
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
176
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different s...
178
click to vote
IJCAI
1989
15 years 7 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
157
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...