Sciweavers

8431 search results - page 1540 / 1687
» Algorithmically Independent Sequences
Sort
View
95
Voted
AAAI
2010
15 years 3 months ago
Stackelberg Voting Games: Computational Aspects and Paradoxes
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can...
Lirong Xia, Vincent Conitzer
SDM
2008
SIAM
125views Data Mining» more  SDM 2008»
15 years 3 months ago
Mining and Ranking Generators of Sequential Patterns
Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements...
David Lo, Siau-Cheng Khoo, Jinyan Li
OPODIS
2004
15 years 3 months ago
Firewall Queries
Firewalls are crucial elements in network security, and have been widely deployed in most businesses and institutions for securing private networks. The function of a firewall is t...
Alex X. Liu, Mohamed G. Gouda, Huibo H. Ma, Anne H...
132
Voted
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 3 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
« Prev « First page 1540 / 1687 Last » Next »