Sciweavers

4426 search results - page 741 / 886
» Concurrent Constraint Programming
Sort
View
134
Voted
APJOR
2010
112views more  APJOR 2010»
15 years 4 months ago
Sample Average Approximation Methods for a Class of Stochastic Variational inequality Problems
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
Huifu Xu
103
Voted
COR
2008
96views more  COR 2008»
15 years 4 months ago
Discrete models for competitive location with foresight
We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective ...
Frank Plastria, Lieselot Vanhaverbeke
COR
2008
112views more  COR 2008»
15 years 4 months ago
Buffer allocation in general single-server queueing networks
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
Frederico R. B. Cruz, A. R. Duarte, Tom Van Woense...
CORR
2010
Springer
83views Education» more  CORR 2010»
15 years 4 months ago
Utility Constrained Energy Minimization In Aloha Networks
In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in t...
Amir Mahdi Khodaian, Babak Hossein Khalaj, Mohamma...
IEE
2008
108views more  IEE 2008»
15 years 4 months ago
Mining execution relations for crosscutting concerns
Aspect mining tries to identify crosscutting concerns in the code of existing systems and thus supports their adaption to an aspect-oriented design. A semi-automatic static aspect...
Jens Krinke