1477 search results - page 76 / 296 » Random Convex Programs |
AI
2002
Springer
13 years 8 months ago
2002
Springer
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
VMCAI
2009
Springer
14 years 3 months ago
2009
Springer
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
CSFW
2010
IEEE
14 years 21 days ago
2010
IEEE
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...