1378 search results - page 77 / 276 » The Tractability of Global Constraints |
138
click to vote
IJCAI
1989
15 years 7 months ago
1989
This paper presents and compares results for three types of connectionist networks on perceptual learning tasks: [A] Multi-layered converging networks of neuron-like units, with e...
172
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
163
click to vote
ICPR
2008
IEEE
16 years 18 days ago
2008
IEEE
In this paper, we propose a new approach to the non-rigid image registration. This problem can be easily attacked if we can find regularly distributed correspondence points over ...
144
click to vote
WSC
2007
15 years 8 months ago
2007
Inbound call center operations are challenging to manage; there is considerable uncertainty in estimates of arrival rates, and the operation is often subject to strict service lev...
121
click to vote
BIOINFORMATICS
2010
15 years 6 months ago
2010
Motivation: To test whether protein folding constraints and secondary structure sequence preferences significantly reduce the space of amino acid words in proteins, we compared th...