Sciweavers

969 search results - page 172 / 194
» Generalized matching from theory to application
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ICLP
2004
Springer
15 years 5 months ago
MProlog: An Extension of Prolog for Modal Logic Programming
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
Linh Anh Nguyen
ATAL
2007
Springer
15 years 3 months ago
Resolving conflict and inconsistency in norm-regulated virtual organizations
Norm-governed virtual organizations define, govern and facilitate coordinated resource sharing and problem solving in societies of agents. With an explicit account of norms, openn...
Wamberto Weber Vasconcelos, Martin J. Kollingbaum,...
ATAL
2010
Springer
15 years 25 days ago
Modeling recursive reasoning by humans using empirically informed interactive POMDPs
Recursive reasoning of the form what do I think that you think that I think (and so on) arises often while acting rationally in multiagent settings. Several multiagent decision-ma...
Prashant Doshi, Xia Qu, Adam Goodie, Diana Young
SIGIR
2010
ACM
14 years 12 months ago
Score distribution models: assumptions, intuition, and robustness to score manipulation
Inferring the score distribution of relevant and non-relevant documents is an essential task for many IR applications (e.g. information filtering, recall-oriented IR, meta-search,...
Evangelos Kanoulas, Keshi Dai, Virgiliu Pavlu, Jav...