Revisiting Cardassian model and cosmic constraint
نویسندگان
چکیده
منابع مشابه
Revisiting constraint-directed search
We revisit the exploration of constraint-directed neighbourhoods, where a (small) set of constraints is picked before considering the neighbouring configurations where those constraints have a decreased (or preserved, or increased) penalty. Given the semantics of a constraint, such neighbourhoods can be represented via new attributes or primitives for the corresponding constraint object. We sho...
متن کاملRevisiting the Sequence Constraint
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a given width. To date, none of the filtering algorithms proposed guaranteed domain consistency. In this paper, we present three filtering algorithms for the sequence constraint, with complementary strengths. One borrows...
متن کاملRevisiting the tree Constraint
This paper revisits the tree constraint introduced in [2] which partitions the nodes of a n-nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only certain nodes can be tree roots. We introduce a new filtering algorithm that enforces generalized arc-consistency in O(n + m) time while the original filtering algorithm reaches O(nm) time. This result allows to ta...
متن کاملRevisiting the Cosmic Cooling Crisis
Recent measurements of the K−band luminosity function now provide us with strong, reliable constraints on the fraction of baryons which have cooled. Globally, this fraction is only about 5%, and there is no strong evidence that it is significantly higher in clusters. Without an effective sub-grid feedback prescription, the cooled gas fraction in any numerical simulation exceeds these observatio...
متن کاملRevisiting dynamic constraint satisfaction for model-based planning
As planning problems become more complex, it is increasingly useful to integrate complex constraints on time and resources into planning models, and use constraint reasoning approaches to help solve the resulting problems. Dynamic constraint satisfaction is a key enabler of automated planning in the presence of such constraints. In this paper, we identify some limitations with the previously de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal C
سال: 2012
ISSN: 1434-6044,1434-6052
DOI: 10.1140/epjc/s10052-012-2134-7