2766 search results - page 359 / 554 » Algorithms for trigonometric polynomials |
114
click to vote
WEBDB
2005
Springer
15 years 10 months ago
2005
Springer
Nonrecursive XQuery is known to be hard for nondeterministic exponential time. Thus it is commonly believed that any algorithm for evaluating XQuery has to require exponential amo...
140
Voted
WINE
2005
Springer
15 years 10 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
115
click to vote
PODC
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
112
click to vote
CONCUR
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
119
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...