Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
803
New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates
, 2010
"... In some voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number k of new candidates will be added. We give a computational study of the latter problem, focusi ..."
Abstract
-
Cited by 12 (5 self)
- Add to MetaCart
In some voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number k of new candidates will be added. We give a computational study of the latter problem
Possible Winners when New Candidates are Added: the Case of Scoring Rules
"... In some voting situations, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number k of new candidates will be added. Focusing on scoring rules, we give complexity results for ..."
Abstract
-
Cited by 18 (6 self)
- Add to MetaCart
In some voting situations, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number k of new candidates will be added. Focusing on scoring rules, we give complexity results
Computational complexity of two variants of the possible winner problem
- In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems
, 2011
"... A possible winner of an election is a candidate that has, in some kind of incomplete-information election, the possibility to win in a complete extension of the election. The first type of problem we study is the Possible co-Winner with respect to the Addition of New Candidates (PcWNA) problem, whic ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
A possible winner of an election is a candidate that has, in some kind of incomplete-information election, the possibility to win in a complete extension of the election. The first type of problem we study is the Possible co-Winner with respect to the Addition of New Candidates (PcWNA) problem
Protein NMR Structure Determination with Automated NOE Assignment Using the New Software CANDID and the Torsion Angle Dynamics Algorithm DYANA
- J. Mol. Biol
, 2002
"... Combined automated NOE assignment and structure determination module (CANDID) is a new software for efficient NMR structure determination of proteins by automated assignment of the NOESY spectra. CANDID uses an iterative approach with multiple cycles of NOE crosspeak assignment and protein structure ..."
Abstract
-
Cited by 148 (10 self)
- Add to MetaCart
Combined automated NOE assignment and structure determination module (CANDID) is a new software for efficient NMR structure determination of proteins by automated assignment of the NOESY spectra. CANDID uses an iterative approach with multiple cycles of NOE crosspeak assignment and protein
Cloning in Elections: Finding the Possible Winners
"... We consider the problem of manipulating elections by cloning candidates. In our model, a manipulator can replace each candidate c by several clones, i.e., new candidates that are so similar to c that each voter simply replaces c in his vote with a block of these new candidates, ranked consecutively. ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
by adding candidates and the problem of possible (co)winners when new alternatives can join. 1.
Release Candidate 1
, 2011
"... information to agencies for the implementation of Personal Identity Verification (PIV) and PIV Interoperable (PIV-I) credentials within their PACS, providing interoperability across the federal enterprise. A PACS is a complex system that includes readers, controllers, head ends, servers, and client ..."
Abstract
- Add to MetaCart
work stations. The emergence of PIV Cards and PIV-I Cards has created a new set of challenges for PACS implementations, including but not limited to new and stronger technologies, non-local card issuance, and new federal policies. HSPD-12 sets a clear goal to improve PACS through the use of government
Towards a dichotomy of finding possible winners in elections based on scoring rules
- In Proc. 34th MFCS, volume 5734 of LNCS
, 2009
"... Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings, the voters may often only provide partial orders. ..."
Abstract
-
Cited by 21 (1 self)
- Add to MetaCart
scoring rule. More precisely, for an unbounded number of candidates and unweighted voters, we show that POSSI-BLE WINNER is NP-complete for all pure scoring rules except plurality, veto, and the scoring rule defined by the scoring vector (2,1,..., 1, 0), while it is solvable in polynomial time
Additional TWA Members? Spectroscopic verification of kinematically selected TWA candidates
, 2002
"... Abstract We present spectroscopic measurements of the 23 new candidate members of the TW Hydrae Association from Makarov & Fabricius (2001). Based on Hα and Li 6708 Å strengths together with location on a color-magnitude diagram for Hipparcos TWA candidates, we found only three possible new memb ..."
Abstract
- Add to MetaCart
Abstract We present spectroscopic measurements of the 23 new candidate members of the TW Hydrae Association from Makarov & Fabricius (2001). Based on Hα and Li 6708 Å strengths together with location on a color-magnitude diagram for Hipparcos TWA candidates, we found only three possible new
On problem kernels for possible winner determination under the k-approval protocol
, 2009
"... Abstract. The POSSIBLE WINNER problem asks whether some distinguished candidate may become the winner of an election when the given incomplete votes (partial orders) are extended into complete ones (linear orders) in a favorable way. Under the k-approval protocol, for every voter, the best k candida ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
candidates of his or her preference order get one point. A candidate with maximum total number of points wins. The POSSIBLE WINNER problem for k-approval is NP-complete even if there are only two votes (and k is part of the input). In addition, it is NPcomplete for every fixed k ∈ {2,..., m − 2} with m
Three Galactic globular cluster candidates?
, 2011
"... Context. The census of Galactic globular clusters (GCs) is still incomplete, and about ten new objects are supposed to await discovery, hidden behind the crowded and reddened regions of the Galactic bulge and disk. Aims. We investigated the nature of three new GC candidates, discovered in the frames ..."
Abstract
- Add to MetaCart
Context. The census of Galactic globular clusters (GCs) is still incomplete, and about ten new objects are supposed to await discovery, hidden behind the crowded and reddened regions of the Galactic bulge and disk. Aims. We investigated the nature of three new GC candidates, discovered
Results 1 - 10
of
803
