3172 search results - page 394 / 635 » On the Random-Self-Reducibility of Complete Sets |
146
click to vote
AI
2007
Springer
15 years 6 months ago
2007
Springer
The increasing variety of semantics proposed in the context of Dung’s theory of argumentation makes more and more inadequate the example-based approach commonly adopted for eval...
148
click to vote
ANOR
2008
15 years 6 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
139
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...
178
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
186
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...