Sciweavers

17920 search results - page 3484 / 3584
» Recentering computer science
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 9 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
ATAL
2005
Springer
15 years 9 months ago
Reasoning about joint beliefs for execution-time communication decisions
Just as POMDPs have been used to reason explicitly about uncertainty in single-agent systems, there has been recent interest in using multi-agent POMDPs to coordinate teams of age...
Maayan Roth, Reid G. Simmons, Manuela M. Veloso
CCS
2005
ACM
15 years 9 months ago
Automated trust negotiation using cryptographic credentials
In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Be...
Jiangtao Li, Ninghui Li, William H. Winsborough
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
15 years 9 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
15 years 9 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
« Prev « First page 3484 / 3584 Last » Next »