Sciweavers

2173 search results - page 149 / 435
» On the Values of Reducibility Candidates
Sort
View
AMC
2008
106views more  AMC 2008»
15 years 6 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
EOR
2008
110views more  EOR 2008»
15 years 6 months ago
Response time and vendor-assembler relationship in a supply chain
Relationships between an assembler and a vendor in a supply chain are investigated in two-period models when the assembler wants to reduce response time by incentive systems. The ...
Seongje Ahn, Hosun Rhim, S. Hun Seog
AUTOMATICA
2006
88views more  AUTOMATICA 2006»
15 years 6 months ago
Exact computation of amplification for a class of nonlinear systems arising from cellular signaling pathways
A commonly employed measure of the signal amplification properties of an input/output system is its induced L2 norm, sometimes also known as H gain. In general, however, it is ext...
Eduardo D. Sontag, Madalena Chaves
MCSS
2006
Springer
15 years 6 months ago
Optimal input sets for time minimality in quantized control systems
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...
Alessia Marigo
IOR
2010
98views more  IOR 2010»
15 years 3 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith