4894 search results - page 340 / 979 » The Guarding Problem - Complexity and Approximation |
179
click to vote
JAIR
2006
15 years 6 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
177
click to vote
GECCO
2006
Springer
15 years 10 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...
174
click to vote
JCAM
2011
14 years 9 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...
154
click to vote
INFOCOM
2009
IEEE
16 years 1 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...
198
click to vote
STACS
2004
Springer
16 years 1 days 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...