2905 search results - page 399 / 581 » Formal Memetic Algorithms |
155
click to vote
FLAIRS
2004
15 years 5 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
133
click to vote
FORTE
2004
15 years 5 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
137
click to vote
AIPS
2003
15 years 5 months ago
2003
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
134
Voted
NIPS
2004
15 years 5 months ago
2004
Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by...
141
click to vote
NIPS
2001
15 years 5 months ago
2001
If the promise of computational modeling is to be fully realized in higherlevel cognitive domains such as language processing, principled methods must be developed to construct th...