Sciweavers

1523 search results - page 245 / 305
» The Computational Complexity of Linear Optics
Sort
View
IVC
2000
179views more  IVC 2000»
13 years 9 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
MOC
1998
108views more  MOC 1998»
13 years 9 months ago
Numerical conformal mapping based on the generalised conjugation operator
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
Bao Cheng Li, Stavros Syngellakis
SCP
1998
107views more  SCP 1998»
13 years 9 months ago
A Distributed Arc-Consistency Algorithm
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
T. Nguyen, Yves Deville
SAC
2008
ACM
13 years 9 months ago
Adaptive methods for sequential importance sampling with application to state space models
Abstract. In this paper we discuss new adaptive proposal strategies for sequential Monte Carlo algorithms--also known as particle filters--relying on new criteria evaluating the qu...
Julien Cornebise, Eric Moulines, Jimmy Olsson
IJSYSC
2010
92views more  IJSYSC 2010»
13 years 8 months ago
Constrained optimal control: an application to semiactive suspension systems
This paper applies three different control techniques to the design of a quarter car semiactive suspension system. The three techniques, originally developed to solve a constrain...
Tina Paschedag, Alessandro Giua, Carla Seatzu