Sciweavers

344 search results - page 6 / 69
» On the Discrete Symmetric Localization Problem
Sort
View
AICOM
2007
61views more  AICOM 2007»
14 years 10 months ago
Scheduling social tournaments locally
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...
Iván Dotú, Pascal Van Hentenryck

Publication
338views
13 years 8 months ago
A Reference Discretization Strategy for the Numerical Solution of Physical Field Problems.
I. Introduction II. Foundations A. The Mathematical Structure of Physical Field Theories B. Geometric Objects and Orientation 1. Space-Time Object...
Claudio Mattiussi
JC
2007
160views more  JC 2007»
14 years 10 months ago
BDDC methods for discontinuous Galerkin discretization of elliptic problems
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization...
Maksymilian Dryja, Juan Galvis, Marcus Sarkis
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
15 years 4 months ago
Using symmetrical regions of interest to improve visual SLAM
— Simultaneous Localization and Mapping (SLAM) based on visual information is a challenging problem. One of the main problems with visual SLAM is to find good quality landmarks,...
Gert Kootstra, Lambert Schomaker
COMPGEOM
2009
ACM
15 years 4 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray