Sciweavers

1146 search results - page 84 / 230
» Finite cupping sets
Sort
View
SIGSOFT
2005
ACM
14 years 9 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
ATVA
2010
Springer
148views Hardware» more  ATVA 2010»
13 years 10 months ago
Recursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Ashutosh Trivedi, Dominik Wojtczak
APAL
2006
57views more  APAL 2006»
13 years 9 months ago
Effective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
Wesley Calvert, Douglas Cenzer, Valentina S. Hariz...
MMAS
2010
Springer
13 years 3 months ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...

Publication
216views
12 years 7 months ago
The Geometry of Time-Stepping
The space-time geometric structure of Maxwell’s equations is examined and a subset of them is found to define a pair of exact discrete time-stepping relations. The desirability ...
Claudio Mattiussi