Search

Your search keyword '"Complexity issues"' showing total 10 results
Start Over Descriptor "Complexity issues"
10 results on '"Complexity issues"'

1. Some Notes on Managing Closure Operators

Author

Rudolph, Sebastian, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Domenach, Florent, editor, Ignatov, Dmitry I., editor, and Poelmans, Jonas, editor

Published
2012
Full Text
View/download PDF

2. Algorithms for Scheduling Problems.

Author

Larysa Burtseva (Ed.), Frank Werner (Ed.), and Yuri Sotskov (Ed.)

Subjects
Agent Based Scheduling, Approximation Algorithms, Assembly Scheduling, Complex Scheduling Problems, Complexity Issues, Energy Management etc, Engineering, Enumerative Algorithms, Evolutionary Algorithms, Healthcare, Just-in-Time Scheduling, Real-Time Scheduling, Scheduling Heuristics and Metaheuristics, Scheduling Problems in Logistics, Scheduling Problems in Segments of a Supply Chain, Scheduling under Resource Constraints, Scheduling under Uncertainty, Sports, Timetabling, Transport, Vehicle Routing
Abstract

Summary: This edited book presents new results in the area of algorithm development for different types of scheduling problems. In eleven chapters, algorithms for single machine problems, flow-shop and job-shop scheduling problems (including their hybrid (flexible) variants), the resource-constrained project scheduling problem, scheduling problems in complex manufacturing systems and supply chains, and workflow scheduling problems are given. The chapters address such subjects as insertion heuristics for energy-efficient scheduling, the re-scheduling of train traffic in real time, control algorithms for short-term scheduling in manufacturing systems, bi-objective optimization of tortilla production, scheduling problems with uncertain (interval) processing times, workflow scheduling for digital signal processor (DSP) clusters, and many more.

3. A Quantitative Extension of Interval Temporal Logic over Infinite Words

Author

Laura Bozzelli and Adriano Peron, Bozzelli, Laura, Peron, Adriano, Laura Bozzelli and Adriano Peron, Bozzelli, Laura, and Peron, Adriano

Abstract

Model checking (MC) for Halpern and Shoham’s interval temporal logic HS has been recently investigated in a systematic way, and it is known to be decidable under three distinct semantics (state-based, trace-based and tree-based semantics), all of them assuming homogeneity in the propositional valuation. Here, we focus on the trace-based semantics, where the main semantic entities are the infinite execution paths (traces) of the given Kripke structure. We introduce a quantitative extension of HS over traces, called Difference HS (DHS), allowing one to express timing constraints on the difference among interval lengths (durations). We show that MC and satisfiability of full DHS are in general undecidable, so, we investigate the decidability border for these problems by considering natural syntactical fragments of DHS. In particular, we identify a maximal decidable fragment DHS_{simple} of DHS proving in addition that the considered problems for this fragment are at least 2Expspace-hard. Moreover, by exploiting new results on linear-time hybrid logics, we show that for an equally expressive fragment of DHS_{simple}, the problems are Expspace-complete. Finally, we provide a characterization of HS over traces by means of the one-variable fragment of a novel hybrid logic.

Published
2022
Full Text
View/download PDF

4. A Quantitative Extension of Interval Temporal Logic over Infinite Words

Author

Bozzelli, L., Peron, A., Bozzelli, L., and Peron, A.

Subjects
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Model checking, Complexity issues, Complexity issue, Quantitative Constraints, Theory of computation → Logic and verification, Linear-time Hybrid Logic, Logic in Computer Science (cs.LO), Homogeneity Assumption, Interval temporal logic, Decision Procedure, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Decision Procedures, Linear-time Hybrid Logics
Abstract

Model checking (MC) for Halpern and Shoham’s interval temporal logic HS has been recently investigated in a systematic way, and it is known to be decidable under three distinct semantics (state-based, trace-based and tree-based semantics), all of them assuming homogeneity in the propositional valuation. Here, we focus on the trace-based semantics, where the main semantic entities are the infinite execution paths (traces) of the given Kripke structure. We introduce a quantitative extension of HS over traces, called Difference HS (DHS), allowing one to express timing constraints on the difference among interval lengths (durations). We show that MC and satisfiability of full DHS are in general undecidable, so, we investigate the decidability border for these problems by considering natural syntactical fragments of DHS. In particular, we identify a maximal decidable fragment DHS_{simple} of DHS proving in addition that the considered problems for this fragment are at least 2Expspace-hard. Moreover, by exploiting new results on linear-time hybrid logics, we show that for an equally expressive fragment of DHS_{simple}, the problems are Expspace-complete. Finally, we provide a characterization of HS over traces by means of the one-variable fragment of a novel hybrid logic., LIPIcs, Vol. 247, 29th International Symposium on Temporal Representation and Reasoning (TIME 2022), pages 11:1-11:16

Published
2022
Full Text
View/download PDF

9. The bandwidth of planar distributive lattices

Author

Faigle, Ulrich, Gierz, Gerhard, Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Tinhofer, Gottfried, editor, and Schmidt, Gunther, editor

Published
1987
Full Text
View/download PDF

10. The node visit cost of brother trees

Author

Klein, Rolf, Wood, Derick, Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Tinhofer, Gottfried, editor, and Schmidt, Gunther, editor

Published
1987
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results