Sciweavers

8496 search results - page 186 / 1700
» Problem Solving and Complex Systems
Sort
View
ICCV
2007
IEEE
14 years 11 months ago
Accurate Non-Iterative O(n) Solution to the PnP Problem
We propose a non-iterative solution to the PnP problem--the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences--whose computational complexity gro...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 9 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
EWSPT
2001
Springer
14 years 2 months ago
A Mobile Agent Approach to Process-Based Dynamic Adaptation of Complex Software Systems
We describe an approach based upon software process technology to on-the-fly monitoring, redeployment, reconfiguration, and in general dynamic adaptation of distributed software ap...
Giuseppe Valetto, Gail E. Kaiser, Gaurav S. Kc
ICEIS
2008
IEEE
14 years 4 months ago
SORCER: Computing and Metacomputing Intergrid
— This paper investigates Grid computing from the point of view three basic computing platforms. The platform consists of virtual compute resources, a programming environment all...
Michael Soblewski
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...