Sciweavers

2465 search results - page 411 / 493
» Automata on Linear Orderings
Sort
View
DAM
2006
132views more  DAM 2006»
15 years 6 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
EJC
2006
15 years 6 months ago
The positive Bergman complex of an oriented matroid
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
Federico Ardila, Caroline J. Klivans, Lauren Willi...
ENDM
2006
69views more  ENDM 2006»
15 years 6 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...
ENTCS
2006
174views more  ENTCS 2006»
15 years 6 months ago
Symbolic Reasoning with Weighted and Normalized Decision Diagrams
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
Jörn Ossowski, Christel Baier
FMSD
2006
104views more  FMSD 2006»
15 years 6 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord