835 search results - page 55 / 167 » Characterizing rosy theories |
107
click to vote
DCG
2006
14 years 12 months ago
2006
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...
PODC
2009
ACM
16 years 10 days ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
ACMSE
2006
ACM
15 years 5 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper reviews and assesses several theoretical perspectives on one type of business-to-business electronic marketplace—collaboration marketplaces. Whereas transaction-orien...
WSC
2008
15 years 2 months ago
2008
We extend the basic theory of kriging, as applied to the design and analysis of deterministic computer experiments, to the stochastic simulation setting. Our goal is to provide fl...