555 search results - page 38 / 111 » Decompositions of Grammar Constraints |
111
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
119
click to vote
ICWS
2008
IEEE
15 years 2 months ago
2008
IEEE
The extensibility, flexibility, expressiveness, and platform-neutrality of XML delivers key advantages for interoperability. The interoperability of XML Web services often comes a...
103
Voted
PARA
1995
Springer
15 years 4 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
137
click to vote
TASLP
2008
15 years 17 days ago
2008
Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only perf...
105
click to vote
VLSM
2005
Springer
15 years 6 months ago
2005
Springer
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...