Zobrazeno 1 - 10
of 108
pro vyhledávání: '"Flener, Pierre"'
Autor:
Forghani, Kamran, Carlsson, Mats, Flener, Pierre, Fredriksson, Magnus, Pearson, Justin, Yuan, Di
Publikováno v:
In Computers and Electronics in Agriculture January 2024 216
Autor:
Arafailova, Ekaterina, Beldiceanu, Nicolas, Douence, Rémi, Carlsson, Mats, Flener, Pierre, Rodríguez, María Andreína Francisco, Pearson, Justin, Simonis, Helmut
First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme. Second it provides the corresponding synthesised catalogue of s
Externí odkaz:
http://arxiv.org/abs/1609.08925
Autor:
Amadini, Roberto, Flener, Pierre, Pearson, Justin, Scott, Joseph D., Stuckey, Peter J., Tack, Guido
Strings are extensively used in modern programming languages and constraints over strings of unknown length occur in a wide range of real-world applications such as software analysis and verification, testing, model checking, and web security. Nevert
Externí odkaz:
http://arxiv.org/abs/1608.03650
Autor:
Flener, Pierre, Pearson, Justin
Airspace sectorisation provides a partition of a given airspace into sectors, subject to geometric constraints and workload constraints, so that some cost metric is minimised. We make a study of the constraints that arise in airspace sectorisation. F
Externí odkaz:
http://arxiv.org/abs/1401.7463
Autor:
Flener, Pierre, Pearson, Justin
Airspace sectorisation provides a partition of a given airspace into sectors, subject to geometric constraints and workload constraints, so that some cost metric is minimised. We survey the algorithmic aspects of methods for automatic airspace sector
Externí odkaz:
http://arxiv.org/abs/1311.0653
Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. Moreover, the wide variety of such constraints in practical applications led to general modelling techniques and generic propagation algorithms, often based
Externí odkaz:
http://arxiv.org/abs/1309.7145
Publikováno v:
EPTCS 5, 2009, pp. 13-25
We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search). We show how it is possible to maintain incrementally the violations of a constraint
Externí odkaz:
http://arxiv.org/abs/0910.1266
Publikováno v:
EPTCS 5, 2009, pp. 27-40
Using constraint-based local search, we effectively model and efficiently solve the problem of balancing the traffic demands on portions of the European airspace while ensuring that their capacity constraints are satisfied. The traffic demand of a po
Externí odkaz:
http://arxiv.org/abs/0910.1239