592 search results - page 66 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
112
click to vote
AAI
2004
15 years 3 months ago
2004
Work allocation planning is a vital and notoriously difficult task in areas characterised by large work forces, contiguous and sometimes overlapping shifts, regulatory and corpora...
140
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
132
click to vote
BIS
2008
15 years 4 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
118
click to vote
AAECC
1999
Springer
15 years 2 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
149
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...