Sciweavers

BSL
2007
60views more  BSL 2007»
13 years 5 months ago
Inner Models and Ultrafilters in L(R)
We present a characterization of supercompactness measures for ω1 in L(R), and of countable products of such measures, using inner models. We give two applications of this charact...
Itay Neeman
FSS
2008
117views more  FSS 2008»
13 years 5 months ago
(S, N)- and R-implications: A state-of-the-art survey
In this work we give a state-of-the-art review of two of the most established classes of fuzzy implications, viz., (S, N)- and R-implications. Firstly, we discuss their properties...
Michal Baczynski, Balasubramaniam Jayaram
DCG
2008
70views more  DCG 2008»
13 years 5 months ago
Decomposability of Polytopes
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...
Krzysztof Przeslawski, David Yost
DCG
2010
71views more  DCG 2010»
13 years 5 months ago
A Characterization of the Angle Defect and the Euler Characteristic in Dimension 2
The angle defect, which is the standard way to measure the curvatures at the vertices of polyhedral surfaces, goes back at least as far as Descartes. Although the angle defect has ...
Ethan D. Bloch
AUTOMATICA
2010
72views more  AUTOMATICA 2010»
13 years 5 months ago
Span-reachability and observability of bilinear hybrid systems
The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is...
Mihály Petreczky, Jan H. van Schuppen
NIPS
2008
13 years 6 months ago
Skill Characterization Based on Betweenness
We present a characterization of a useful class of skills based on a graphical representation of an agent's interaction with its environment. Our characterization uses betwee...
Özgür Simsek, Andrew G. Barto
AMAST
2006
Springer
13 years 8 months ago
Some Programming Languages for Logspace and Ptime
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
Guillaume Bonfante
LATIN
1992
Springer
13 years 9 months ago
On Reversible Automata
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
Jean-Eric Pin
PPSN
1998
Springer
13 years 9 months ago
On Risky Methods for Local Selection under Noise
The choice of the selection method used in an evolutionary algorithm may have considerable impacts on the behavior of the entire algorithm. Therefore, earlier work was devoted to t...
Günter Rudolph
ITC
2003
IEEE
126views Hardware» more  ITC 2003»
13 years 10 months ago
Deformations of IC Structure in Test and Yield Learning
This paper argues that the existing approaches to modeling and characterization of IC malfunctions are inadequate for test and yield learning of Deep Sub-Micron (DSM) products. Tr...
Wojciech Maly, Anne E. Gattiker, Thomas Zanon, Tho...