801 search results - page 14 / 161 » Computational intelligence in solving bioinformatics problem... |
89
Voted
AAAI
1997
15 years 3 months ago
1997
Automated problem solving is viewed typically as the expenditure of computation to solve one or more problems passed to a reasoning system. In response to each problem received, e...
113
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
133
click to vote
AMAI
2000
Springer
15 years 5 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
119
click to vote
AAAI
1998
15 years 3 months ago
1998
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
160
click to vote
PACT
1999
Springer
15 years 6 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...