2766 search results - page 144 / 554 » Algorithms for trigonometric polynomials |
172
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
142
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
142
click to vote
ISSAC
1995
Springer
15 years 7 months ago
1995
Springer
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
132
click to vote
AAAI
2006
15 years 5 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
132
click to vote
ICCAD
2003
IEEE
16 years 29 days ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...