6562 search results - page 132 / 1313 » Noetherianity and Combination Problems |
167
Voted
CONSTRAINTS
2010
15 years 4 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
137
click to vote
RE
2004
Springer
15 years 10 months ago
2004
Springer
Jackson’s Problem Frames provide a means of analysing and decomposing problems. They emphasise the world outside the computer helping the developer to focus on the problem domai...
135
click to vote
JAIR
2007
15 years 4 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
132
Voted
IJHCI
2006
15 years 4 months ago
2006
Severity assessments enable prioritization of problems encountered during usability evaluations and thereby provide a device for guiding the utilization of design resources. Howeve...