Sciweavers

1170 search results - page 22 / 234
» How Fast Is Too Fast
Sort
View
114
Voted
AIR
2004
111views more  AIR 2004»
15 years 21 days ago
Towards Fast Vickrey Pricing using Constraint Programming
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
Alan Holland, Barry O'Sullivan
73
Voted
IPL
1998
68views more  IPL 1998»
15 years 14 days ago
Fast Nondeterministic Recognition of Context-Free Languages Using two Queues
We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.
Burton Rosenberg
107
Voted
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
15 years 2 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
ACSAC
1999
IEEE
15 years 5 months ago
A Parallel Packet Screen for High Speed Networks
This paper demonstrates why security issues related to the continually increasing bandwidth of High Speed Networks (HSN) cannot be addressed with conventional firewall mechanisms....
Carsten Benecke
103
Voted
IPPS
1998
IEEE
15 years 5 months ago
Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
Ruben Gamboa