2766 search results - page 334 / 554 » Algorithms for trigonometric polynomials |
141
click to vote
JWSR
2007
15 years 4 months ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
146
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
134
click to vote
NETWORKS
2007
15 years 4 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
111
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
160
click to vote
SPIN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...