8201 search results - page 247 / 1641 » Approaching Manual Intelligence |
179
click to vote
ATAL
2006
Springer
15 years 11 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
197
click to vote
CSCLP
2004
Springer
15 years 11 months ago
2004
Springer
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
186
click to vote
CP
2006
Springer
15 years 11 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...
189
click to vote
AIIA
1995
Springer
15 years 10 months ago
1995
Springer
In this paper we describe a framework for reasoning about temporal explanation problems, which is based on our previous work on model-based diagnosis of dynamic systems. We use an ...
176
click to vote
AI
2010
Springer
15 years 10 months ago
2010
Springer
Automatic discovery of network applications is a very challenging task which has received a lot of attentions due to its importance in many areas such as network security, QoS prov...