697 search results - page 49 / 140 » On the Theory of Average Case Complexity |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
SIGMETRICS
2010
ACM
14 years 20 days ago
2010
ACM
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such ...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
CAISE
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Parthood is a relation of fundamental importance in a number of disciplines including cognitive science, linguistics and conceptual modeling. However, one classical probl...