Sciweavers

175 search results - page 12 / 35
» Partially Ordered Runs: A Case Study
Sort
View
JSYML
2007
100views more  JSYML 2007»
13 years 7 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
IROS
2009
IEEE
136views Robotics» more  IROS 2009»
14 years 2 months ago
Integrating asynchronous observations for mobile robot position tracking in cooperative environments
— This paper presents an asynchronous particle filter algorithm for mobile robot position tracking, taking into account time considerations when integrating observations being d...
Andreu Corominas Murtra, Josep Maria Mirats i Tur,...
PSTV
1992
113views Hardware» more  PSTV 1992»
13 years 8 months ago
Coverage Preserving Reduction Strategies for Reachability Analysis
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
Gerard J. Holzmann, Patrice Godefroid, Didier Piro...
IPPS
2006
IEEE
14 years 1 months ago
Exploiting processing locality through paging configurations in multitasked reconfigurable systems
FPGA chips in reconfigurable computer systems are used as malleable coprocessors where components of a hardware library of functions can be configured as needed. As the number of ...
T. Taher, Tarek A. El-Ghazawi
BMCBI
2010
95views more  BMCBI 2010»
13 years 7 months ago
Heuristics for the inversion median problem
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...