805 search results - page 104 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
142
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Gene clustering for annotating gene functions is one of the fundamental issues in bioinformatics. The best clustering solution is often regularized by multiple constra...
173
click to vote
KR
1992
Springer
15 years 8 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
132
click to vote
AIPS
2010
15 years 6 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
138
click to vote
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name...
133
click to vote
COLT
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...