292 search results - page 6 / 59 » Are Stable Instances Easy |
94
Voted
JAR
2007
15 years 18 days ago
2007
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
85
Voted
AAAI
1997
15 years 2 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
127
click to vote
CLIMA
2010
15 years 27 days ago
2010
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
107
Voted
NN
1998
Springer
15 years 10 days ago
1998
Springer
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...
102
click to vote
IRI
2005
IEEE
15 years 6 months ago
2005
IEEE
The AnyInformationHiding design pattern models the concept of information hiding and the interactions between parties associated with it in any application. Information hiding is ...