8337 search results - page 82 / 1668 » Reasoning With Characteristic Models |
120
click to vote
AAAI
2000
15 years 5 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
119
click to vote
EOR
2002
15 years 4 months ago
2002
Decision trees allow the modeling of event-dependent reasoning, but do not consider the dynamics of contextual changes in reasoning. In the framework of the SART project, which ai...
140
click to vote
PERCOM
2007
ACM
16 years 3 months ago
2007
ACM
One issue hindering the deployment of integrated ubicomp environments is the lack of a shared model for applications to utilize resources across administrative and network domains...
152
click to vote
JSW
2008
15 years 4 months ago
2008
Automated negotiation is an important applying field of agent theory and technology. For the current agent theoretical models have some troubles in explaining the agent's nego...
141
Voted
GPEM
2002
15 years 3 months ago
2002
A representation-less model for genetic programming is presented. The model is intended to examine the mechanisms that lead to bloat in genetic programming (GP). We discuss two hyp...