2766 search results - page 489 / 554 » Algorithms for trigonometric polynomials |
100
click to vote
TCS
2010
14 years 10 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
112
click to vote
ICAI
2010
14 years 9 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
130
click to vote
ICCAD
2010
IEEE
14 years 9 months ago
2010
IEEE
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
106
click to vote
SEMWEB
2010
Springer
14 years 9 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...