Sciweavers

1132 search results - page 128 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
APAL
2008
84views more  APAL 2008»
15 years 6 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
ENDM
2010
105views more  ENDM 2010»
15 years 6 months ago
Minimizing Expected Attacking Cost in Networks
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbe...
JSAC
2006
91views more  JSAC 2006»
15 years 6 months ago
Innovative model for time-varying power line communication channel response evaluation
Abstract--This work presents a channel model for the broadband characterization of power lines in presence of time variation of the loads. The model is characterized by taking into...
Sami Barmada, Antonino Musolino, Marco Raugi
MP
2008
103views more  MP 2008»
15 years 6 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
CORR
2002
Springer
86views Education» more  CORR 2002»
15 years 6 months ago
Small Strictly Convex Quadrilateral Meshes of Point Sets
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
David Bremner, Ferran Hurtado, Suneeta Ramaswami, ...