Sciweavers

3690 search results - page 166 / 738
» Computation with classical sequents
Sort
View
140
Voted
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 4 months ago
Pushdown Control-Flow Analysis of Higher-Order Programs
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
Christopher Earl, Matthew Might, David Van Horn
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 4 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
AI
2006
Springer
15 years 4 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
149
Voted
ENTCS
2006
118views more  ENTCS 2006»
15 years 4 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson
JASIS
2008
109views more  JASIS 2008»
15 years 4 months ago
Modifying the journal impact factor by fractional citation weighting: The audience factor
A new approach to the field normalization of the classical journal impact factor is introduced called the audience factor. This approach takes into consideration the citing propen...
Michel Zitt, Henry Small