Sciweavers

9842 search results - page 172 / 1969
» Problem complexity
Sort
View
109
Voted
PODC
2010
ACM
15 years 22 days ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...
ICSOC
2010
Springer
15 years 7 days ago
Programmable Fault Injection Testbeds for Complex SOA
Abstract. The modularity of Service-oriented Architectures (SOA) allows to establish complex distributed systems comprising e.g., services, clients, brokers, and workflow engines. ...
Lukasz Juszczyk, Schahram Dustdar
ICCV
2007
IEEE
16 years 4 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...
EAGC
2004
Springer
15 years 7 months ago
A Grid-Enabled Adaptive Problem Solving Environment
AS complexity of computational applications and their environments has been increased due to the heterogeneity of resources; complexity, continuous changes of the applications as w...
Yoonhee Kim, Ilkyeun Ra, Salim Hariri, Yangwoo Kim
CP
1999
Springer
15 years 6 months ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz