6562 search results - page 410 / 1313 » Noetherianity and Combination Problems |
169
Voted
FSTTCS
2003
Springer
16 years 2 days ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
194
Voted
GD
2003
Springer
16 years 2 days ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
163
click to vote
IDA
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
164
click to vote
ISHPC
2003
Springer
16 years 1 days ago
2003
Springer
The paper presents the design and development of an online remote trace measurement and analysis system. The work combines the strengths of the TAU performance system with that of ...
185
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Controlling the timing performance of a network server is a challenging problem. This paper presents a Queueing Model Based Feedback Control approach to keep the timing performanc...