17541 search results - page 3207 / 3509 » Complexity in scalable computing |
176
click to vote
ICDCN
2009
Springer
15 years 12 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
151
click to vote
CCECE
2009
IEEE
15 years 12 months ago
2009
IEEE
The inverse diffusion problems deal with the estimation of many crucial parameters such as the diffusion coefficient, source properties, and boundary conditions. Such algorithms ...
150
click to vote
CSE
2009
IEEE
15 years 12 months ago
2009
IEEE
Abstract—Today’s wirelessly networked embedded systems underlie a vast array of electronic devices, performing computation, communication, and input/output. A major design goal...
149
click to vote
FOCS
2009
IEEE
15 years 12 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
139
click to vote
FOCS
2009
IEEE
15 years 12 months ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...