16404 search results - page 2387 / 3281 » A set coverage problem |
214
Voted
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
222
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
211
Voted
GI
2007
Springer
16 years 1 months ago
2007
Springer
: State-of-the-art interoperability between heterogeneous systems on a technical level builds on services oriented architectures (SOA) for a given problem space. Semantics can be i...
221
click to vote
KI
2007
Springer
16 years 1 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
194
Voted
PKC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...