Sciweavers

20 search results - page 2 / 4
» On some problems related to palindrome closure
Sort
View
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 2 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
APPML
2005
55views more  APPML 2005»
13 years 5 months ago
Recovering a phylogenetic tree using pairwise closure operations
A fundamental task in evolutionary biology is the amalgamation of a collection P of leaf-labelled trees into a single parent tree. A desirable feature of any such amalgamation is ...
Katharina T. Huber, Vincent Moulton, Charles Sempl...
ICSE
1993
IEEE-ACM
13 years 9 months ago
"...And Nothing Else Changes": The Frame Problem in Procedure Specifications
We give examples of situations where formal specifications of procedures in the standard pre/postcondition style become lengthy, cumbersome and difficult to change, a problem whic...
Alexander Borgida, John Mylopoulos, Raymond Reiter
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
13 years 9 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
EFDBS
2003
13 years 6 months ago
Four-Level-Architecture for Closure in Interoperability
A definition of types in an information system is given from ld abstractions through data constructs, schema and definitions to physical data values. Category theory suggests tha...
B. Nick Rossiter, Michael A. Heather