2723 search results - page 7 / 545 » Learning lexicographic orders |
TLCA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
HEURISTICS
2008
13 years 5 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
JGO
2011
13 years 2 months ago
2011
Shippers are daily users of the French gas grid. Differences between planned and effective gas demand unbalance the grid. To restore the balance, GRTgaz computes every day amoun...
PPAM
2007
Springer
14 years 1 months ago
2007
Springer
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The repre...
WG
2001
Springer
13 years 11 months ago
2001
Springer
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...