Sciweavers

1055 search results - page 208 / 211
» Enumerations in computable structure theory
Sort
View
CDES
2006
99views Hardware» more  CDES 2006»
13 years 9 months ago
Realization of Digital Fuzzy Operations Using Multi-Valued Fredkin Gates
Multi-valued Fredkin gates (MVFG) are reversible gates and they can be considered as modified version of the better known reversible gate the Fredkin gate. Reversible logic gates ...
Amin Ahsan Ali, Hafiz Md. Hasan Babu, Ahsan Raja C...
GEOINFO
2003
13 years 9 months ago
Modelling Spatial Relations by Generalized Proximity Matrices
One of the main challenges for the development of spatial information theory is the formalization of the concepts of space and spatial relations. Currently, most spatial data struc...
Ana Paula Dutra de Aguiar, Gilberto Câmara, ...
ACL
1997
13 years 9 months ago
Towards Resolution of Bridging Descriptions
We present preliminary results concerning robust techniques for resolving bridging definite descriptions. We report our analysis of a collection of 20 Wall Street Journal articles...
Renata Vieira, Simone Teufel
SCAI
1993
13 years 9 months ago
A Case-Based Answer to Some Problems of Knowledge-Based Systems
Among the most important challenges for contemporary AI research are the development of methods for improved robustness, adaptability, and overall interactiveness of systems. Inter...
Agnar Aamodt
AI
2010
Springer
13 years 7 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim