4843 search results - page 331 / 969 » The Shortcut Problem - Complexity and Approximation |
138
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
131
click to vote
JCAM
2011
14 years 7 months ago
2011
Collocation methods are a well developed approach for the numerical solution of smooth and weakly-singular Volterra integral equations. In this paper we extend these methods, thro...
127
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
152
Voted
STACS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
114
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a...