Sciweavers

220 search results - page 26 / 44
» Improved Algorithms for Univariate Discretization of Continu...
Sort
View
AIIDE
2006
13 years 9 months ago
The Self Organization of Context for Learning in MultiAgent Games
Reinforcement learning is an effective machine learning paradigm in domains represented by compact and discrete state-action spaces. In high-dimensional and continuous domains, ti...
Christopher D. White, Dave Brogan
COMPGEOM
2010
ACM
14 years 18 days ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
CCCG
2008
13 years 9 months ago
Application of computational geometry to network p-center location problems
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
Qiaosheng Shi, Binay K. Bhattacharya
PERCOM
2009
ACM
14 years 2 months ago
Delaunay-Triangulation Based Complete Coverage in Wireless Sensor Networks
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
Chinh T. Vu, Yingshu Li
AES
2005
Springer
105views Cryptology» more  AES 2005»
13 years 7 months ago
TH-collocation for the biharmonic equation
This paper is intended as a contribution to enhance orthogonal collocation methods. In this, a novel collocation method--TH-collocation--is applied to the biharmonic equation and ...
Martín Díaz, Ismael Herrera