Sciweavers

952 search results - page 82 / 191
» Computational complexity of stochastic programming problems
Sort
View
112
Voted
ICRA
2005
IEEE
145views Robotics» more  ICRA 2005»
15 years 6 months ago
Computation and Graphical Characterization of Robust Multiple-Contact Postures in 2D Gravitational Environments
— This paper is concerned with the problem of identifying robust equilibrium postures of a planar mechanism supported by fixed frictional contacts in a twodimensional gravitation...
Yizhar Or, Elon Rimon
106
Voted
CVIU
2008
109views more  CVIU 2008»
15 years 20 days ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
103
Voted
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 17 days ago
A Generic Deployment Framework for Grid Computing and Distributed Applications
Deployment of distributed applications on large systems, and especially on grid infrastructures, becomes a more and more complex task. Grid users spend a lot of time to prepare, in...
Areski Flissi, Philippe Merle
ICALP
2007
Springer
15 years 6 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
113
Voted
COMSWARE
2007
IEEE
15 years 7 months ago
On Optimal Performance in Mobile Ad hoc Networks
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...
Tapas K. Patra, Joy Kuri, Pavan Nuggehalli