Sciweavers

1813 search results - page 131 / 363
» Calculi of Approximation Spaces
Sort
View
JELIA
1998
Springer
15 years 10 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
IDEAL
2005
Springer
15 years 12 months ago
Bearing Similarity Measures for Self-organizing Feature Maps
The neural representation of space in rats has inspired many navigation systems for robots. In particular, Self-Organizing (Feature) Maps (SOM) are often used to give a sense of lo...
Narongdech Keeratipranon, Frédéric M...
CIA
2006
Springer
15 years 10 months ago
Eliminating Interdependencies Between Issues for Multi-issue Negotiation
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...
CIKM
2008
Springer
15 years 8 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
CDC
2009
IEEE
15 years 11 months ago
Dynamic practical stabilization of sampled-data linear distributed parameter systems
Abstract— In this paper, dynamic practical stability properties of infinite-dimensional sampled-data systems are discussed. A family of finite-dimensional discrete-time control...
Ying Tan, Emmanuel Trélat, Yacine Chitour, ...