Sciweavers

2181 search results - page 20 / 437
» The restriction scaffold problem
Sort
View
ECAI
2004
Springer
14 years 2 months ago
Tractable Symmetry Breaking Using Restricted Search Trees
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, St...
EJC
2010
13 years 8 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
DLOG
2010
13 years 6 months ago
Correcting Access Restrictions to a Consequence
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on co...
Martin Knechtel, Rafael Peñaloza
SCHEDULING
2010
59views more  SCHEDULING 2010»
13 years 7 months ago
Implicit shift scheduling with multiple breaks and work stretch duration restrictions
This paper considers a shift scheduling problem that includes different forms of flexibility in terms of shift starting times, break lengths and break placement. Two particular ...
Monia Rekik, Jean-François Cordeau, Fran&cc...
ESWS
2010
Springer
14 years 1 months ago
A Generic Approach for Correcting Access Restrictions to a Consequence
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on as...
Martin Knechtel, Rafael Peñaloza