Sciweavers

1051 search results - page 179 / 211
» Foundations of Constraint Satisfaction
Sort
View
JAIR
2008
110views more  JAIR 2008»
13 years 9 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
AI
2005
Springer
13 years 9 months ago
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
Richard J. Wallace, Eugene C. Freuder
JAIR
2007
159views more  JAIR 2007»
13 years 9 months ago
Combination Strategies for Semantic Role Labeling
This paper introduces and analyzes a battery of inference models for the problem of semantic role labeling: one based on constraint satisfaction, and several strategies that model...
Mihai Surdeanu, Lluís Màrquez, Xavie...
JETAI
2007
141views more  JETAI 2007»
13 years 9 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
COMCOM
2004
94views more  COMCOM 2004»
13 years 9 months ago
An economic model for the radio resource management in multimedia wireless systems
In this paper, we study the connection between Radio Resource Management and economic parameters, whose application in multimedia communication system is a challenging task. In fa...
Leonardo Badia, Magnus Lindström, Jens Zander...