Sciweavers

5608 search results - page 763 / 1122
» On the Theory of Matchgate Computations
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 6 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
AICOM
2004
118views more  AICOM 2004»
15 years 6 months ago
Qualitative pattern matching with linguistic terms
Abstract. In the framework of possibility theory, a tool named `fuzzy pattern matching' (FPM) has been proposed in the eighties and since successfully used in flexible queryin...
Yannick Loiseau, Henri Prade, Mohand Boughanem
CLUSTER
2009
IEEE
16 years 1 months ago
Power-aware scheduling of virtual machines in DVFS-enabled clusters
—With the advent of Cloud computing, large-scale virtualized compute and data centers are becoming common in the computing industry. These distributed systems leverage commodity ...
Gregor von Laszewski, Lizhe Wang, Andrew J. Younge...
CCA
2009
Springer
16 years 1 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
SMA
2005
ACM
132views Solid Modeling» more  SMA 2005»
16 years 10 days ago
Simplified engineering analysis via medial mesh reduction
Numerous simplification methods have been proposed for speeding up engineering analysis/ simulation. A recently proposed medial axis reduction is one such method, that is particul...
Murari Sinha, Krishnan Suresh