Sciweavers

7092 search results - page 1054 / 1419
» Parallelizing constraint programs
Sort
View
COR
2008
96views more  COR 2008»
15 years 6 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 6 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 6 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 6 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
EOR
2006
70views more  EOR 2006»
15 years 6 months ago
Search allocation game
This paper deals with a multi-stage two-person zero-sum game called the multi-stage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher dist...
Ryusuke Hohzaki
« Prev « First page 1054 / 1419 Last » Next »