Sciweavers

351 search results - page 56 / 71
» Classical proof forestry
Sort
View
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
14 years 1 months ago
Learning, anticipation and time-deception in evolutionary online dynamic optimization
In this paper we focus on an important source of problem– difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the tr...
Peter A. N. Bosman
TPHOL
2002
IEEE
14 years 15 days ago
Free-Style Theorem Proving
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
David Delahaye
ICALP
2001
Springer
14 years 2 days ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
CSL
2000
Springer
13 years 12 months ago
Composition and Submachine Concepts for Sequential ASMs
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
Egon Börger, Joachim Schmid
PODC
1997
ACM
13 years 11 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert