Sciweavers

3628 search results - page 202 / 726
» The Decision Diffie-Hellman Problem
Sort
View
139
Voted
CORR
2012
Springer
174views Education» more  CORR 2012»
13 years 11 months ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
135
Voted
AAAI
2008
15 years 6 months ago
Interaction Structure and Dimensionality Reduction in Decentralized MDPs
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
Martin Allen, Marek Petrik, Shlomo Zilberstein
117
Voted
WSC
2008
15 years 6 months ago
A comparative study of genetic algorithm components in simulation-based optimisation
In this paper, we present a comparative study of different stochastic components of genetic algorithms for simulationbased optimisation of the buffer allocation problem. We explor...
Birkan Can, Andreas Beham, Cathal Heavey
145
Voted
EOR
2008
100views more  EOR 2008»
15 years 2 months ago
Urban rapid transit network capacity expansion
The rapid transit network design problem consists on the location of the train alignments and stations in an urban traffic context. The location problem incorporates the demand dec...
Ángel Marín, Patricia Jaramillo
119
Voted
DAC
1999
ACM
16 years 4 months ago
Soft Scheduling in High Level Synthesis
In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers,...
Jianwen Zhu, Daniel Gajski