3495 search results - page 617 / 699 » On the random satisfiable process |
182
click to vote
AAAI
1996
15 years 7 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
323
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
176
click to vote
AAAI
2010
15 years 6 months ago
2010
Many methods for quantitative structure-activity relationships (QSARs) deliver point estimates only, without quantifying the uncertainty inherent in the prediction. One way to qua...
184
click to vote
HPDC
2010
IEEE
15 years 6 months ago
2010
IEEE
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
179
click to vote
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...