Results 1 - 10 of 11,255

The Computational Difficulty of Manipulating an Election

by J. J. Bartholdi, III, C. A. Tovey, M. A. Trick - SOCIAL CHOICE WELFARE , 1989
"... We show how computational complexity might protect the integrity of social choice. We exhibit a voting rule that efficiently computes winners but is computationally resistant to strategic manipulation. It is NP-complete for a manipulative voter to determine how to exploit knowledge of the preferenc ..."
Abstract - Cited by 179 (0 self) - Add to MetaCart
We show how computational complexity might protect the integrity of social choice. We exhibit a voting rule that efficiently computes winners but is computationally resistant to strategic manipulation. It is NP-complete for a manipulative voter to determine how to exploit knowledge

The Computational Difficulty of Bribery in Qualitative

by Coalitional Games, Andrew J. Dowell, Michael Wooldridge, Peter Mcburney, Andrew Dowell, Michael Wooldridge, Peter Mcburney, Fondazione Eni, Enrico Mattei, Coalitional Games, Andrew Dowell , 2007
"... Qualitative coalitional games (QCG) are representations of coalitional games in which self interested agents, each with their own individual goals, group together in order to achieve a set of goals which satisfy all the agents within that group. In such a representation, it is the strategy of the ag ..."
Abstract - Add to MetaCart
of the agents to find the best coalition to join. Previous work into QCGs has investigated the computational complexity of determining which is the best coalition to join. We plan to expand on this work by investigating the computational complexity of computing agent power in QCGs as well as by showing

The Computational Difficulty Of ID/LP Parsing

by G. Edward Barton, Jr. , 1985
"... Modern linguistic theory attributes surface complexity to interacting subsystems of constraints. For instance, the ID. LP gr,'un mar formalism separates constraints on immediate dominance from those on linear order. 5hieber's ([983) ID/I.P parsing algorithm shows how to use ID .and LP cons ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
of Shieber's algorithm is actually exponential in gra,nmar size. The growth of parser data str,,ctures causes the difficulty. Some computational and linguistic implications follow: in particular, it is important to note that despite its potential for combinatorial explosion, Shieber's algorithm

A survey of context-aware mobile computing research

by Guanling Chen, David Kotz , 2000
"... Context-aware computing is a mobile computing paradigm in which applications can discover and take advantage of contextual information (such as user location, time of day, nearby people and devices, and user activity). Since it was proposed about a decade ago, many researchers have studied this topi ..."
Abstract - Cited by 692 (2 self) - Add to MetaCart
for research. The difficulties and possible solutions we outline serve as guidance for researchers hoping to make context-aware computing a reality.

The process group approach to reliable distributed computing

by Kenneth P. Birman - Communications of the ACM , 1993
"... The difficulty of developing reliable distributed softwme is an impediment to applying distributed computing technology in many settings. Expeti _ with the Isis system suggests that a structured approach based on virtually synchronous _ groups yields systems that are substantially easier to develop, ..."
Abstract - Cited by 572 (19 self) - Add to MetaCart
The difficulty of developing reliable distributed softwme is an impediment to applying distributed computing technology in many settings. Expeti _ with the Isis system suggests that a structured approach based on virtually synchronous _ groups yields systems that are substantially easier to develop

Theoretical improvements in algorithmic efficiency for network flow problems

by Jack Edmonds, Richard M. Karp - , 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract - Cited by 560 (0 self) - Add to MetaCart
required by earlier algorithms. First, the paper states the maximum flow problem, gives the Ford-Fulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties

Efficiently computing static single assignment form and the control dependence graph

by Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck - ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS , 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract - Cited by 1003 (8 self) - Add to MetaCart
, the difficulty of their construction and their potential size have discouraged their use. We present new algorithms that efficiently compute these data structures for arbitrary control flow graphs. The algorithms use dominance frontiers, a new concept that may have other applications. We also give analytical

Probabilistic Inference Using Markov Chain Monte Carlo Methods

by Radford M. Neal , 1993
"... Probabilistic inference is an attractive approach to uncertain reasoning and empirical learning in artificial intelligence. Computational difficulties arise, however, because probabilistic models with the necessary realism and flexibility lead to complex distributions over high-dimensional spaces. R ..."
Abstract - Cited by 736 (24 self) - Add to MetaCart
Probabilistic inference is an attractive approach to uncertain reasoning and empirical learning in artificial intelligence. Computational difficulties arise, however, because probabilistic models with the necessary realism and flexibility lead to complex distributions over high-dimensional spaces

A public key cryptosystem and a signature scheme based on discrete logarithms

by Taher Elgamal - ADV. IN CRYPTOLOGY, SPRINGER-VERLAG , 1985
"... A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields. ..."
Abstract - Cited by 1551 (0 self) - Add to MetaCart
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.

Assessing agreement on classification tasks: the kappa statistic

by Jean Carletta - Computational Linguistics , 1996
"... Currently, computational linguists and cognitive scientists working in the area of discourse and dialogue argue that their subjective judgments are reliable using several different statistics, none of which are easily interpretable or comparable to each other. Meanwhile, researchers in content analy ..."
Abstract - Cited by 846 (9 self) - Add to MetaCart
analysis have already experienced the same difficulties and come up with a solution in the kappa statistic. We discuss what is wrong with reliability measures as they are currently used for discourse and dialogue work in computational linguistics and cognitive science, and argue that we would be better off
Results 1 - 10 of 11,255