3653 search results - page 695 / 731 » On Recognizable Timed Languages |
CP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
OOPSLA
2005
Springer
14 years 4 months ago
2005
Springer
Organic programming (OP) is our proposed and already emerging programming model which overcomes some of the limitations of current practice in software development in general and ...