Sciweavers

7055 search results - page 223 / 1411
» Some New 4-Designs
Sort
View
CP
2006
Springer
15 years 10 months ago
Constraint Programming Models for Graceful Graphs
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
Barbara M. Smith
FSE
2000
Springer
85views Cryptology» more  FSE 2000»
15 years 10 months ago
Mercy: A Fast Large Block Cipher for Disk Sector Encryption
Abstract. We discuss the special requirements imposed on the underlying cipher of systems which encrypt each sector of a disk partition independently, and demonstrate a certificati...
Paul Crowley
MFCS
2000
Springer
15 years 10 months ago
Periodic-Like Words
In this paper we investigate the periodic structure of rich words (i.e., words having the highest possible number of palindromic factors), giving new results relating them with per...
Arturo Carpi, Aldo de Luca
HICSS
1997
IEEE
80views Biometrics» more  HICSS 1997»
15 years 10 months ago
Unbundling Power Quality Services: Technical Issues
The modern industrial facility depends on sensitive electronic equipment that can be shut down suddenly by severe power system disturbances. A large number of these disturbances o...
Robert Lasseter
149
Voted
AIPS
2010
15 years 9 months ago
Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina