6142 search results - page 529 / 1229 » The Complexity of Partition Functions |
200
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
175
click to vote
HICSS
2005
IEEE
16 years 19 days ago
2005
IEEE
Recently, peer-to-peer systems have become widely accepted and are probably the most recognizable examples of distributed applications. As they are maturing and their functionalit...
142
click to vote
SG
2010
Springer
16 years 2 days ago
2010
Springer
This paper is an artist statement describing a manipulation of the Mandelbrot Set equation as the basis for creating semi-figurative images, using a genetic algorithm. Modernist pa...
176
click to vote
MPC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
166
click to vote
DIMACS
2001
15 years 8 months ago
2001
The notion of relative closure (X, Y )0 of a semi-Pfaffian couple (X, Y ) was introduced by Gabrielov to give a description of the o-minimal structure generated by Pfaffian functio...