Sciweavers

3602 search results - page 3 / 721
» Isn't It About Time
Sort
View
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
13 years 11 months ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
SIGACT
1998
105views more  SIGACT 1998»
13 years 5 months ago
Everything you wanted to know about the running time of Mergesort but were afraid to ask
Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. A...
Ian Parberry
FOSSACS
2000
Springer
13 years 10 months ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
Kai Engelhardt, Ron van der Meyden, Yoram Moses
IPPS
2003
IEEE
13 years 11 months ago
Reasoning about Deadlines in Concurrent Real-Time Programs
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machinedependent task. Th...
Sibylle Peuker, Ian J. Hayes
PODS
1990
ACM
150views Database» more  PODS 1990»
13 years 10 months ago
On Being Optimistic about Real-Time Constraints
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
Jayant R. Haritsa, Michael J. Carey, Miron Livny