Sciweavers

1071 search results - page 29 / 215
» Programming with enumerable sets of structures
Sort
View
ECAI
2008
Springer
14 years 21 days ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
ENTCS
2008
97views more  ENTCS 2008»
13 years 11 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
ENTCS
2008
97views more  ENTCS 2008»
13 years 11 months ago
Global State Considered Helpful
Reynolds' view of a storage cell as an expression-acceptor pair has been widely used by researchers. We present a different way of organizing semantics of state, and in parti...
Paul Blain Levy
MICRO
2009
IEEE
326views Hardware» more  MICRO 2009»
14 years 5 months ago
DDT: design and evaluation of a dynamic program analysis for optimizing data structure usage
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
Changhee Jung, Nathan Clark
ESCIENCE
2006
IEEE
14 years 5 months ago
Application-Level Resource Provisioning on the Grid
In this paper, we present algorithms for Grid resource provisioning that employ agreement-based resource management. These algorithms allow userlevel resource allocation and sched...
Gurmeet Singh, Carl Kesselman, Ewa Deelman