Sciweavers

216 search results - page 35 / 44
» From Constraints to Finite Automata to Filtering Algorithms
Sort
View
JAR
2006
236views more  JAR 2006»
13 years 8 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
RTAS
1999
IEEE
14 years 20 days ago
Scalable Scheduling Support for Loss and Delay Constrained Media Streams
Real-time media servers need to service hundreds and, possibly, thousands of clients, each with their own quality of service (QoS) requirements. To guarantee such diverse QoS requ...
Richard West, Karsten Schwan, Christian Poellabaue...
RSS
2007
129views Robotics» more  RSS 2007»
13 years 9 months ago
Spatially-Adaptive Learning Rates for Online Incremental SLAM
— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computationa...
Edwin Olson, John J. Leonard, Seth J. Teller
FOCS
1992
IEEE
14 years 14 days ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
VLSID
1998
IEEE
116views VLSI» more  VLSID 1998»
14 years 19 days ago
Synthesis of Testable RTL Designs
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
C. P. Ravikumar, Sumit Gupta, Akshay Jajoo