Sciweavers

162 search results - page 24 / 33
» Completeness Guarantees for Incomplete Reasoners
Sort
View
82
Voted
ASPLOS
2006
ACM
15 years 3 months ago
Tradeoffs in transactional memory virtualization
For transactional memory (TM) to achieve widespread acceptance, transactions should not be limited to the physical resources of any specific hardware implementation. TM systems s...
JaeWoong Chung, Chi Cao Minh, Austen McDonald, Tra...
JMLR
2006
169views more  JMLR 2006»
14 years 9 months ago
Bayesian Network Learning with Parameter Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
CSL
2008
Springer
14 years 11 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe
RTCSA
2000
IEEE
15 years 2 months ago
Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
Radu Dobrin, Yusuf Özdemir, Gerhard Fohler
AB
2008
Springer
15 years 4 months ago
An Algorithm for Qualitative Simulation of Gene Regulatory Networks with Steep Sigmoidal Response Functions
A specific class of ODEs has been shown to be adequate to describe the essential features of the complex dynamics of Gene-Regulatory Networks (GRN). But, the effective exploitatio...
Liliana Ironi, Luigi Panzeri, Erik Plahte