279 search results - page 46 / 56 » Matching Polynomials And Duality |
ESA
2004
Springer
14 years 1 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...
CDC
2009
IEEE
14 years 9 days ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...