Sciweavers

2027 search results - page 48 / 406
» When is it best to best-respond
Sort
View
IJCAI
1997
13 years 11 months ago
Learning Short-Term Weights for GSAT
We investigate an improvement to GSAT which associates a weight with each clause. We change the objective function so that GSAT moves to assignments maximizing the weight of satis...
Jeremy Frank
WSC
1998
13 years 11 months ago
Accelerated Simulation for Pricing Asian Options
When pricing options via Monte Carlo simulations, precision can be improved either by performing longer simulations, or by reducing the variance of the estimators. In this paper, ...
Felisa J. Vázquez-Abad, Daniel Dufresne
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
13 years 11 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein
IANDC
2008
80views more  IANDC 2008»
13 years 10 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
JCM
2007
90views more  JCM 2007»
13 years 10 months ago
Peak to Average Power Ratio Reduction for Multicarrier Systems Using Dirty Paper Coding
— In this paper, we improve the peak to average power ratio reduction scheme for multicarrier systems proposed by Collings and Clarkson by applying dirty paper coding with peak p...
Pin-Hsun Lin, Shih-Chun Lin, Hsuan-Tien Liu, Hsuan...