Sciweavers

2398 search results - page 144 / 480
» Constraint Programming and Graph Algorithms
Sort
View
ESOP
1994
Springer
15 years 9 months ago
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Torben Amtoft
IPPS
2006
IEEE
15 years 11 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
ILP
2004
Springer
15 years 10 months ago
Learning Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
Fabrizio Riguzzi
IWOCA
2009
Springer
153views Algorithms» more  IWOCA 2009»
15 years 11 months ago
Feedback Vertex Set on Graphs of Low Cliquewidth
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
141
Voted
ESOP
2000
Springer
15 years 8 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne