555 search results - page 59 / 111 » Decompositions of Grammar Constraints |
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
108
Voted
ECSA
2010
Springer
15 years 1 months ago
2010
Springer
One of the major advantages of component-based software engineering is the ability for developers to reuse and assemble software entities to build complex software. Whereas decompo...
101
Voted
AIPS
2000
15 years 2 months ago
2000
In the last years, some very promising domain independent heuristic state-space planners for STRIPS worlds, like ASP/HSP, HSPr and GRT, have been presented. These planners achieve...
SIAMJO
2008
15 years 19 days ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
TSP
2008
15 years 18 days ago
2008
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...