5864 search results - page 214 / 1173 » Can We Work around Numerical Methods |
172
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
155
Voted
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper presents a critical analysis of the Pareto-Following Variation Operator (PFVO) when used as an approximation method for Multiobjective Evolutionary Algorithms (MOEA)...
176
click to vote
SIGECOM
2011
ACM
14 years 7 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
172
click to vote
SIGCOMM
2005
ACM
15 years 10 months ago
2005
ACM
We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practica...
144
click to vote
ICML
2000
IEEE
16 years 5 months ago
2000
IEEE
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...