Sciweavers

1598 search results - page 65 / 320
» A Unified Computation Model for Functional and Logic Program...
Sort
View
ANOR
2005
72views more  ANOR 2005»
15 years 4 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
141
Voted
CCGRID
2002
IEEE
15 years 9 months ago
Symphony - A Java-Based Composition and Manipulation Framework for Computational Grids
We introduce the Symphony framework, a software ion layer that can sit on top of grid systems. Symphony provides a unified API for grid application developers and offers a graphic...
Markus Lorch, Dennis G. Kafura
231
Voted
CP
2009
Springer
16 years 5 months ago
From Model-Checking to Temporal Logic Constraint Solving
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
Aurélien Rizk, François Fages
POPL
2007
ACM
16 years 4 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
300
Voted
DIMACS
1996
15 years 5 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin