Results 311 to 320 of about 260,054 (360)
Some of the next articles are maybe not open access.
Operations Research, 1973
This note focuses on two new and related cut strategies for integer programming: the “convexity-cut” and “cut-search” strategies. The fundamental notions underlying the convexity-cut approach are due to Richard D. Young and Egon Balas, whose “hypercylindrical” and “intersection” cuts provide the conceptual starting points for the slightly more general
openaire +1 more source
This note focuses on two new and related cut strategies for integer programming: the “convexity-cut” and “cut-search” strategies. The fundamental notions underlying the convexity-cut approach are due to Richard D. Young and Egon Balas, whose “hypercylindrical” and “intersection” cuts provide the conceptual starting points for the slightly more general
openaire +1 more source
Nursing Standard, 1988
It is horrifying that the Government has the audacity to consider cutting special rates for nurses. We can hardly survive on the wages we receive now.
openaire +2 more sources
It is horrifying that the Government has the audacity to consider cutting special rates for nurses. We can hardly survive on the wages we receive now.
openaire +2 more sources
Clinical Physics and Physiological Measurement, 1991
Bone cutting has always been a problem for surgeons because bone is a hard living material, and many osteotomes are still very crude tools. Technical improvement of these surgical tools has first been their motorization. Studies of the bone cutting process have indicated better features for conventional tools.
J Y, Giraud +5 more
openaire +2 more sources
Bone cutting has always been a problem for surgeons because bone is a hard living material, and many osteotomes are still very crude tools. Technical improvement of these surgical tools has first been their motorization. Studies of the bone cutting process have indicated better features for conventional tools.
J Y, Giraud +5 more
openaire +2 more sources
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design - ICCAD '06, 2006
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond 6 or 7 inputs because it enumerates all cuts and there are too many of them. We address the enumeration problem by introducing the notion of cut factorization.
Satrajit Chatterjee +2 more
openaire +1 more source
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond 6 or 7 inputs because it enumerates all cuts and there are too many of them. We address the enumeration problem by introducing the notion of cut factorization.
Satrajit Chatterjee +2 more
openaire +1 more source
Nursing Standard, 1987
Revelations in the popular press last week that the Government is considering scrapping special duty payments has left nurses gasping with shock.
openaire +2 more sources
Revelations in the popular press last week that the Government is considering scrapping special duty payments has left nurses gasping with shock.
openaire +2 more sources
Topological equivalences of $$\mathbf {CUT}$$ CUT and $$\mathbf {CUT(Fin)}$$ CUT ( Fin )
Archive for Mathematical Logic, 2016In this note, two well-known topological facts regarding cofinite and cocountable-like topologies over uncountable sets are shown to be equivalent either to the Countable Union Theorem or to the Countable Union Theorem for countable families of finite sets.
openaire +1 more source