Sciweavers

205 search results - page 13 / 41
» On Parameterized Approximability
Sort
View
ECCC
2006
71views more  ECCC 2006»
13 years 7 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
RSFDGRC
2005
Springer
111views Data Mining» more  RSFDGRC 2005»
14 years 27 days ago
Feature Selection with Adjustable Criteria
Abstract. We present a study on a rough set based approach for feature selection. Instead of using significance or support, Parameterized Average Support Heuristic (PASH) consider...
Jingtao Yao, Ming Zhang
JGTOOLS
2008
109views more  JGTOOLS 2008»
13 years 7 months ago
Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
Petrik Clarberg
INFORMS
2010
90views more  INFORMS 2010»
13 years 5 months ago
Approximate Dynamic Programming for Ambulance Redeployment
We present an approximate dynamic programming approach for making ambulance redeployment decisions in an emergency medical service system. The primary decision is where we should ...
Matthew S. Maxwell, Mateo Restrepo, Shane G. Hende...
JSC
2010
102views more  JSC 2010»
13 years 5 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu