Sciweavers

1449 search results - page 48 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
JAIR
2010
153views more  JAIR 2010»
15 years 4 months ago
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
Michael Benisch, George B. Davis, Tuomas Sandholm
CPM
1997
Springer
87views Combinatorics» more  CPM 1997»
15 years 10 months ago
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
Masamichi Miyazaki, Ayumi Shinohara, Masayuki Take...
FOCS
2000
IEEE
15 years 9 months ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala
CORR
1999
Springer
116views Education» more  CORR 1999»
15 years 5 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
CP
1999
Springer
15 years 10 months ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz