Sciweavers

534 search results - page 73 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
FOCS
2004
IEEE
14 years 17 days ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair
HYBRID
2010
Springer
14 years 3 months ago
On integration of event-based estimation and robust MPC in a feedback loop
The main purpose of event-based control, if compared to periodic control, is to minimize data transfer or processing power in networked control systems. Current methods have an (i...
Joris Sijs, Mircea Lazar, W. P. M. H. Heemels
ICLP
1997
Springer
14 years 1 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
GPCE
2004
Springer
14 years 2 months ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen
CN
2007
146views more  CN 2007»
13 years 8 months ago
Autonomic control and personalization of a wireless access network
As ICT services are becoming more ubiquitous and mobile and access technologies grow to be more heterogeneous and complex, we are witnessing the increasing importance of two relat...
Nicola Blefari-Melazzi, Dario Di Sorte, Mauro Femm...