Sciweavers

3359 search results - page 180 / 672
» A Simplified Idea Algorithm
Sort
View
ENTCS
2006
119views more  ENTCS 2006»
15 years 4 months ago
Syntax-driven Behavior Partitioning for Model-checking of Esterel Programs
We consider the issue of exploiting the structural form of ESTEREL programs to partition the algorithmic RSS (reachable state space) fix-point construction used in model-checking t...
Eric Vecchié, Robert de Simone
MSCS
2008
87views more  MSCS 2008»
15 years 4 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
Zhaohui Luo
ICML
2010
IEEE
15 years 2 months ago
Approximate Predictive Representations of Partially Observable Systems
We provide a novel view of learning an approximate model of a partially observable environment from data and present a simple implemenf the idea. The learned model abstracts away ...
Monica Dinculescu, Doina Precup
CVPR
2006
IEEE
16 years 6 months ago
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson
DAC
1998
ACM
16 years 5 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak