2214 search results - page 307 / 443 » complexity 2004 |
126
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
115
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
120
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
129
click to vote
ESAS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Low power consumption, low gate count, and high throughput are standard design criteria for cryptographic coprocessors designated for resource constrained devices such as...
123
click to vote
ESAW
2004
Springer
15 years 9 months ago
2004
Springer
The agent metaphor has shown its usefulness for modelling as well as implementing complex and dynamic applications. Although a number of agent applications has been successfully re...