Sciweavers

3155 search results - page 522 / 631
» How Are You Doing
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 11 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
EJC
2010
13 years 11 months ago
On loop identities that can be obtained by a nuclear identification
We start by describing all the varieties of loops Q that can be defined by autotopisms x, x Q, where x is a composition of two triples, each of which becomes an autotopism when th...
Ales Drápal, Premysl Jedlicka
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 11 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud
BMCBI
2007
168views more  BMCBI 2007»
13 years 11 months ago
Bayesian model-based inference of transcription factor activity
Background: In many approaches to the inference and modeling of regulatory interactions using microarray data, the expression of the gene coding for the transcription factor is co...
Simon Rogers, Raya Khanin, Mark Girolami
IOR
2008
128views more  IOR 2008»
13 years 11 months ago
Promised Lead-Time Contracts Under Asymmetric Information
We study the important problem of how a supplier should optimally share the consequences of demand uncertainty (i.e., the cost of inventory excesses and shortages) with a retailer...
Holly Lutze, Özalp Özer