6562 search results - page 316 / 1313 » Noetherianity and Combination Problems |
132
Voted
ICSE
2009
IEEE-ACM
15 years 11 months ago
2009
IEEE-ACM
In this paper we address the problem of combining software components with different and possibly incompatible legal licenses to create a software application that does not viola...
136
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
194
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
168
click to vote
ISCAS
1994
IEEE
15 years 11 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
210
click to vote
FLAIRS
2007
15 years 9 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...