Sciweavers

4894 search results - page 78 / 979
» Choices
Sort
View
APPROX
2010
Springer
146views Algorithms» more  APPROX 2010»
15 years 7 months ago
Delaying Satisfiability for Random 2SAT
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
Alistair Sinclair, Dan Vilenchik
BMCBI
2008
139views more  BMCBI 2008»
15 years 6 months ago
The C1C2: A framework for simultaneous model selection and assessment
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg
CORR
2010
Springer
64views Education» more  CORR 2010»
15 years 6 months ago
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix
Given a matrix A Rm
Ali Çivril, Malik Magdon-Ismail
FAC
2006
92views more  FAC 2006»
15 years 6 months ago
Action Refinement Applied to Late Decisions
In modular approaches to specify concurrent systems a system is built up from components using various operators as e.g. the sequential, the parallel, or the choice (+) operator. U...
Harald Fecher, Mila E. Majster-Cederbaum
MSS
2008
IEEE
82views Hardware» more  MSS 2008»
15 years 6 months ago
Revealed preference and indifferent selection
It is shown that preferences can be constructed from observed choice behavior in a way that is robust to indifferent selection (i.e., the agent is indifferent between two alternat...
Eric Danan