Sciweavers

3475 search results - page 403 / 695
» Backbones in Optimization and Approximation
Sort
View
IJRR
2008
115views more  IJRR 2008»
15 years 6 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
MONET
2008
135views more  MONET 2008»
15 years 6 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
PAMI
2006
168views more  PAMI 2006»
15 years 6 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...
JC
2007
94views more  JC 2007»
15 years 6 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
CCE
2004
15 years 6 months ago
A strategy for MINLP synthesis of flexible and operable processes
This paper presents a sequential two-stage strategy for the stochastic synthesis of chemical processes in which flexibility and ability to adjust manipulated variables are taken i...
Zorka Novak Pintaric, Zdravko Kravanja