Sciweavers

1477 search results - page 160 / 296
» Random Convex Programs
Sort
View
SPAA
2009
ACM
14 years 9 months ago
Brief announcement: selfishness in transactional memory
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
Raphael Eidenbenz, Roger Wattenhofer
WSC
2004
13 years 10 months ago
Decision Tree Module Within Decision Support Simulation System
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
Mohamed Moussa, Janaka Y. Ruwanpura, George Jergea...
APLAS
2010
ACM
13 years 9 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...
CLEIEJ
2006
126views more  CLEIEJ 2006»
13 years 9 months ago
Software Based Fault Tolerance against Byzantine Failures
The proposed software technique is a very low cost and an effective solution towards designing Byzantine fault tolerant computing application systems that are not so safety critic...
Goutam Kumar Saha
TCS
2010
13 years 7 months ago
On the computational power of BlenX
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
Alessandro Romanel, Corrado Priami