Sciweavers

2583 search results - page 34 / 517
» On the Representation of Timed Polyhedra
Sort
View
CEC
2008
IEEE
13 years 11 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
ICCD
1996
IEEE
170views Hardware» more  ICCD 1996»
14 years 1 months ago
Boolean Function Representation Based on Disjoint-Support Decompositions
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
Valeria Bertacco, Maurizio Damiani
WOA
2007
13 years 10 months ago
Declarative representation of curricula models: an LTL- and UML-based approach
Abstract—In this work, we present a constrained-based representation for specifying the goals of “course design”, that we call curricula model, and introduce a graphical lang...
Matteo Baldoni, Cristina Baroglio, Giuseppe Berio,...
ATVA
2006
Springer
133views Hardware» more  ATVA 2006»
14 years 23 days ago
Branching-Time Property Preservation Between Real-Time Systems
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
Jinfeng Huang, Marc Geilen, Jeroen Voeten, Henk Co...
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
14 years 9 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...