7988 search results - page 1227 / 1598 » A Useful Undecidable Theory |
174
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
196
click to vote
HIPC
2005
Springer
16 years 11 days ago
2005
Springer
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
180
click to vote
ICCS
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for da...
176
click to vote
ICDT
2005
ACM
16 years 11 days ago
2005
ACM
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
155
click to vote
ITRUST
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. This research aims to develop a model of trust and reputation that will ensure good interactions amongst software agents in large scale open systems in particular. The fo...