Sciweavers

951 search results - page 36 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
HICSS
2000
IEEE
208views Biometrics» more  HICSS 2000»
15 years 2 months ago
Transfer Capability Computations in Deregulated Power Systems
With the recent trend towards deregulating power systems around the world, transfer capability computation emerges as the key issue to a smoothly running power market with multipl...
Mohamed Shaaban, Yixin Ni, Felix F. Wu
AAAI
2007
15 years 22 days ago
Computational Complexity of Weighted Threshold Games
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
91
Voted
MVA
1996
129views Computer Vision» more  MVA 1996»
14 years 11 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
15 years 4 months ago
Computing correlated equilibria of polynomial games via adaptive discretization
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...
CORR
2006
Springer
93views Education» more  CORR 2006»
14 years 10 months ago
Fast and Simple Methods For Computing Control Points
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
Jean H. Gallier, Weqing Gu