Sciweavers

169 search results - page 5 / 34
» A weakly stable algorithm for general Toeplitz systems
Sort
View
CODES
2003
IEEE
14 years 3 months ago
Deriving process networks from weakly dynamic applications in system-level design
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...
Todor Stefanov, Ed F. Deprettere
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 9 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
ICTAC
2004
Springer
14 years 3 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
EUROSYS
2009
ACM
14 years 1 months ago
Effective and efficient compromise recovery for weakly consistent replication
Weakly consistent replication of data has become increasingly important both for loosely-coupled collections of personal devices and for large-scale infrastructure services. Unfor...
Prince Mahajan, Ramakrishna Kotla, Catherine C. Ma...
SIGCOMM
2009
ACM
14 years 4 months ago
Stable and flexible iBGP
Routing oscillation is highly detrimental. It can decrease performance and lead to a high level of update churn placing unnecessary workload on router the problem is distributed b...
Ashley Flavel, Matthew Roughan