2944 search results - page 448 / 589 » On Well Quasi-orders on Languages |
164
click to vote
CP
2005
Springer
16 years 40 min ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
169
click to vote
CP
2005
Springer
16 years 34 min ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
171
click to vote
EGH
2005
Springer
15 years 12 months ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
166
click to vote
ESWS
2005
Springer
15 years 12 months ago
2005
Springer
The power of Web Service (WS) technology lies in the fact that it establishes a common, vendor-neutral platform for integrating distributed computing applications, in intranets as ...
163
click to vote
GW
2005
Springer
15 years 12 months ago
2005
Springer
We aim at creating an expressive Embodied Conversational Agent (ECA) and address the problem of synthesizing expressive agent gestures. In our previous work, we have described the ...