5214 search results - page 59 / 1043 » The Online Specialization Problem |
ISIPTA
1999
IEEE
15 years 8 months ago
1999
IEEE
Inferential problems that arise in the empirical analysis oftreatmentresponseinduceambiguityabouttheidentity of optimal treatment rules. This paper describes a research program th...
122
click to vote
COR
2007
15 years 3 months ago
2007
Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a r...
120
click to vote
MP
2006
15 years 3 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
156
click to vote
MOC
2002
15 years 3 months ago
2002
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
136
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...