Sciweavers

1066 search results - page 121 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
AOR
2006
95views more  AOR 2006»
14 years 10 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
TAMC
2010
Springer
15 years 2 months ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret
CCE
2008
14 years 10 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
PDP
2007
IEEE
15 years 4 months ago
Monitoring and Analysis Framework for Grid Middleware
As the use of complex grid middleware becomes widespread and more facilites are offered by these pieces of software, distributed Grid applications are becoming more and more popul...
Ramon Nou, Ferran Julià, David Carrera, Kev...
GRID
2006
Springer
14 years 9 months ago
Monitoring and analysing a Grid Middleware Node
Distributed Grid applications are becoming more and more popular as the use of complex grid middlewares becomes extensive, and more facilities are offered by these complex pieces o...
Ramon Nou, Ferran Julià, David Carrera, Kev...