𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast Theta-Subsumption with Constraint Satisfaction Algorithms

✍ Scribed by Jérôme Maloberti; Michèle Sebag


Book ID
111597711
Publisher
Springer
Year
2004
Tongue
English
Weight
513 KB
Volume
55
Category
Article
ISSN
0885-6125

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Fast enumeration algorithm for words wit
✍ Yu. S. Medvedeva; B. Ya. Ryabko 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 374 KB

We propose an algorithm for enumeration and denumeration of words with given constraints on run lengths of ones (dklr-sequences). For large n, operation time of the algorithm (per symbol of a sequence) is at most O(log 3 n log log n), where n is the length of enumerated words, whereas for the best k

96/06109 Solving the unit commitment pro
📂 Article 📅 1996 🏛 Elsevier Science ⚖ 194 KB

The paper presents a study of the dynamic behaviour of a static frequency converter driving a 300 MVA synchronous generator which is used in a pumped storage power plant of Taiwan Power Company. ## 96/061W A modified linear programming method for distributlon system reconfiguration Abur, A.