Sciweavers

3172 search results - page 348 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
JAR
2010
98views more  JAR 2010»
15 years 1 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
JAR
2010
95views more  JAR 2010»
15 years 1 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
JMLR
2010
157views more  JMLR 2010»
15 years 1 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
JSYML
2010
120views more  JSYML 2010»
15 years 1 months ago
Universally measurable subgroups of countable index
We prove that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the i...
Christian Rosendal
MEMETIC
2010
311views more  MEMETIC 2010»
15 years 1 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer