388 search results - page 52 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
107
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
129
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
QEST
2010
IEEE
14 years 9 months ago
2010
IEEE
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
DAC
2006
ACM
16 years 23 days ago
2006
ACM
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
116
click to vote
HYBRID
2009
Springer
15 years 6 months ago
2009
Springer
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...