Sciweavers

956 search results - page 94 / 192
» Dimensions in program synthesis
Sort
View
118
Voted
ICDCS
2003
IEEE
15 years 8 months ago
Enhancing The Fault-Tolerance of Nonmasking Programs
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
Sandeep S. Kulkarni, Ali Ebnenasir
122
Voted
ICALP
1994
Springer
15 years 6 months ago
On some Relations between Dynamical Systems and Transition Systems
Abstract. In this paper we de ne a precise notion of abstraction relation between continuous dynamical systems and discrete state-transition systems. Our main result states that ev...
Eugene Asarin, Oded Maler
122
Voted
AIPS
2008
15 years 5 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
96
Voted
DAM
2007
94views more  DAM 2007»
15 years 2 months ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
141
Voted
ICALP
2009
Springer
16 years 3 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal