1864 search results - page 310 / 373 » Formal topology and domains |
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Service matchmaking is the process of finding suitable services given by the providers for the service requests of consumers. Previous approaches to service matchmaking is mostly ...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Multiagent environments are often highly dynamic and only partially observable which makes deliberative action planning computationally hard. In many such environments, however, a...
ECAI
2006
Springer
13 years 10 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
CIVR
2008
Springer
13 years 10 months ago
2008
Springer
Medical CBIR (content-based image retrieval) applications pose unique challenges but at the same time offer many new opportunities. On one hand, while one can easily understand ne...