Sciweavers

11129 search results - page 253 / 2226
» Modeling Search Computing Applications
Sort
View
JAR
2006
106views more  JAR 2006»
15 years 6 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
ECIR
2009
Springer
16 years 3 months ago
Joint Ranking for Multilingual Web Search
Ranking for multilingual information retrieval (MLIR) is a task to rank documents of different languages solely based on their relevancy to the query regardless of query’s langu...
Wei Gao, Cheng Niu, Ming Zhou, Kam-Fai Wong
AAAI
2000
15 years 8 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
16 years 19 days ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
173
Voted
PERCOM
2010
ACM
15 years 5 months ago
Towards ontology-driven development of applications for smart environments
—In the environments where heterogeneous devices need to share information, utilize services of each other, and participate as components in various smart applications, it is com...
Artem Katasonov, Marko Palviainen