1204 search results - page 130 / 241 » Termination of Polynomial Programs |
195
click to vote
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
100
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
We study the effects of faulty data on NP-hard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are...
106
click to vote
WINE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
109
click to vote
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...