Sciweavers

4066 search results - page 322 / 814
» Almost Complete Sets
Sort
View
148
Voted
ANOR
2008
69views more  ANOR 2008»
15 years 6 months ago
NP-hardness results for the aggregation of linear orders into median orders
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...
Olivier Hudry
AUTOMATICA
2010
95views more  AUTOMATICA 2010»
15 years 6 months ago
Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
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...
Tove Gustavi, Dimos V. Dimarogonas, Magnus Egerste...
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 6 months ago
Local algorithms in (weakly) coloured graphs
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 ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 6 months ago
Liberalizing Dependency
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...
Avik Chaudhuri
ENGL
2008
121views more  ENGL 2008»
15 years 6 months ago
Prediction of Protein-Protein Interactions Using Pairwise Alignment and Inter-Domain Linker Region
One of the central problems in modern biology is to identify the complete set of interactions among the proteins in a cell. The structural interaction of proteins and their domains...
Nazar Zaki