68 search results - page 7 / 14 » Higher-order functional reactive programming in bounded spac... |
IWMM
2007
Springer
15 years 5 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
116
click to vote
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
143
Voted
ESA
2010
Springer
15 years 21 days ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...