9842 search results - page 1482 / 1969 » The Complexity of the Matching-Cut Problem |
193
click to vote
COORDINATION
2004
Springer
16 years 12 days ago
2004
Springer
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented....
174
click to vote
EUROPAR
2004
Springer
16 years 11 days ago
2004
Springer
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
202
click to vote
FSTTCS
2004
Springer
16 years 11 days ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
173
click to vote
GECCO
2004
Springer
16 years 11 days ago
2004
Springer
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
172
click to vote
ICCS
2004
Springer
16 years 11 days ago
2004
Springer
The DisCAS system employs and interacts with multiple ELIMINOs distributed over the Internet to achieve a distributed-parallel computing environment. ELIMINO is a computer algebra ...