Sciweavers

484 search results - page 3 / 97
» Perfect Derived Propagators
Sort
View
ACSC
2003
IEEE
14 years 2 months ago
Path-Planning by Tessellation of Obstacles
We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble a...
Tane Pendragon, R. Lyndon While
IWFM
2003
123views Formal Methods» more  IWFM 2003»
13 years 10 months ago
Derivation of Distributed Programs in the Theory of Owicki and Gries: An Example
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
Doug Goldson
SIAMSC
2010
153views more  SIAMSC 2010»
13 years 7 months ago
Asymptotic Imaging of Perfectly Conducting Cracks
In this paper, we consider cracks with Dirichlet boundary conditions. We first derive an asymptotic expansion of the boundary perturbations that are due to the presence of a smal...
Habib Ammari, Hyeonbae Kang, Hyundae Lee, Won-Kwan...
VTC
2008
IEEE
118views Communications» more  VTC 2008»
14 years 3 months ago
Cellular MIMO Channel Capacities of MC-CDMA and OFDM
—Multicarrier transmission techniques (i.e., orthogonal frequency division multiplexing (OFDM) and multi-carrier code division multiple access (MC-CDMA)) are the promising candid...
Koichi Adachi, Fumiyuki Adachi, Masao Nakagawa
UAI
2004
13 years 10 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter