Sciweavers

1569 search results - page 88 / 314
» Programming contest strategy
Sort
View
ECAI
2008
Springer
15 years 2 months ago
Belief Revision through Forgetting Conditionals in Conditional Probabilistic Logic Programs
Abstract. In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probab...
Anbu Yue, Weiru Liu
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
15 years 17 days ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
CP
2010
Springer
14 years 10 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
107
Voted
ENTCS
2008
89views more  ENTCS 2008»
15 years 15 days ago
A Quantum Game Semantics for the Measurement Calculus
In this paper we present a game semantics for a quantum programming language based on a new definition of quantum strategies. The language studied is MCdata, a typed version of th...
Yannick Delbecque
93
Voted
ATS
2003
IEEE
105views Hardware» more  ATS 2003»
15 years 5 months ago
Minimizing Defective Part Level Using a Linear Programming-Based Optimal Test Selection Method
Recent probabilistic test generation approaches have proven that detecting single stuck-at faults multiple times is effective at reducing the defective part level (DPL). Unfortuna...
Yuxin Tian, Michael R. Grimaila, Weiping Shi, M. R...