Sciweavers

52 search results - page 5 / 11
» Characterizing Provability in
Sort
View
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
14 years 1 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 9 months ago
Embedded Rank Distance Codes for ISI channels
Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time...
Sanket Dusad, Suhas N. Diggavi, A. Robert Calderba...
COMPSAC
2010
IEEE
13 years 7 months ago
Specifying Time-Sensitive Systems with TLA+
We present a pattern-based method to express time specifications in the language TLA+ . A real-time module RealTimeNew is introduced to encapsulate the definitions of commonly used...
Hehua Zhang, Ming Gu, Xiaoyu Song
CDC
2008
IEEE
14 years 4 months ago
Effects of topology in networked systems: Stochastic methods and small worlds
— The topology of a networked control system has critical consequences for its performance. We provide first substantial examples on the effects of topology. Then we proceed to ...
John S. Baras, Pedram Hovareshti
LOPSTR
1997
Springer
14 years 2 months ago
Implicit Program Synthesis by a Reversible Metainterpreter
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
Henning Christiansen