Jump to main content

yr 〜
yr

Search results 28

BUDGET ALLOCATION AND THE ANALYTIC HIERARCHY PROCESS (SAND ; SAND-90-7091)

BUDGET ALLOCATION AND THE ANALYTIC HIERARCHY PROCESS (SAND ; SAND-90-7091)
Paper図書
HULME, B.L. (SANDIA NATIONAL LABS., ALBUQUERQUE, NM (USA)// HULME MATHEMATICS, ALBUQUERQUE, NM (USA))Sandia National Laboratories(Sandia National Laboratories)1990.
Other Libraries in Japan
  • Author HeadingHULME, B.L. HULME MATHEMATICS, ALBUQUERQU...

Manufacturing networks (Sandia report ; SAND-86-1136; TTC-0663; DE87003282)

Manufacturing networks (Sandia report ; SAND-86-1136; TTC-0663; DE87003282)
Paper図書
Hulme, B.L.Sandia National Lab.1986.11.
Other Libraries in Japan
  • Author HeadingHulme, B.L.

Adversary pathfinding (Sandia report ; SAND-85-2796C; CONF-860359-3; DE86005630)

Adversary pathfinding (Sandia report ; SAND-85-2796C; CONF-860359-3; DE86005630)
Paper図書
Hulme, B.L.Sandia National Labs.1986.01.
Other Libraries in Japan
  • Author HeadingHulme, B.L.

SET COVERING, PARTITION AND PACKING. (SAND ; SAND-84-0447)

SET COVERING, PARTITION AND PACKING. (SAND ; SAND-84-0447)
Paper図書
HULME, B.L.(et al.)Sandia National Laboratories(Sandia National Laboratories)1984.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

BOOLEAN COMPUTATION OF OPTIMUM HITTING SETS. (SAND ; SAND-84-0448)

BOOLEAN COMPUTATION OF OPTIMUM HITTING SETS. (SAND ; SAND-84-0448)
Paper図書
HULME, B.L(et al.)Sandia National Laboratories(Sandia National Laboratories)1984.
Other Libraries in Japan

COMBINATORIAL OPTIMIZATION WITH BOOLEAN CONSTRAINTS. (SAND ; SAND-83-0085)

COMBINATORIAL OPTIMIZATION WITH BOOLEAN CONSTRAINTS. (SAND ; SAND-83-0085)
Paper図書
HULME, B.L.(et al.)Sandia National Laboratories(Sandia National Laboratories)1983.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

BOOLEAN ALGEBRAIC ANALYSIS OF FIRE PROTECTION. (SAND ; SAND-82-0583C)

BOOLEAN ALGEBRAIC ANALYSIS OF FIRE PROTECTION. (SAND ; SAND-82-0583C)
Paper図書
HULME, B.L.(et al.)Sandia National Laboratories(Sandia National Laboratories)1982.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

COMPUTING MINIMUM COST FIRE PROTECTION. (SAND ; SAND-82-0809)

COMPUTING MINIMUM COST FIRE PROTECTION. (SAND ; SAND-82-0809)
Paper図書
HULME, B.L.(et al.)Sandia National Laboratories(Sandia National Laboratories)1982.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

BOOLEAN METHODSOF OPTIMIZATION OVER INDEPENDENCE SYSTEMS. (SAND ; SAND-1304C)

BOOLEAN METHODSOF OPTIMIZATION OVER INDEPENDENCE SYSTEMS. (SAND ; SAND-1304C)
Paper図書
HULME, B.L.Sandia National Laboratories(Sandia National Laboratories)1983.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

MONOTONE BOOLEAN APPROXIMATION. (SAND ; SAND-82-2357)

MONOTONE BOOLEAN APPROXIMATION. (SAND ; SAND-82-2357)
Paper図書
HULME, B.L.Sandia National Laboratories(Sandia National Laboratories)1982.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

NETWORK ANALYSIS OF FIRE PROTECTION. (SAND ; SAND-81-0528J)

NETWORK ANALYSIS OF FIRE PROTECTION. (SAND ; SAND-81-0528J)
Paper図書
HULME, B.L.(et al.)Sandia National Laboratories(Sandia National Laboratories)1981.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

ADPATH: AN ADVERSARY PATH SUBROUTINE. (NUREG ; NUREG-CR-0869; SAND-79-1205)

ADPATH: AN ADVERSARY PATH SUBROUTINE. (NUREG ; NUREG-CR-0869; SAND-79-1205)
Paper図書
HULME, B.L.(et al.)NUREG (U.S. Nuclear Regulatory Commission)(NUREG (U.S. Nuclear Regulatory Commission))1979.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

POST: A SUBROUTINE FOR PATH ORDERING OF SABOTAGE TARGETS. (NUREG ; NUREG-CR-1226)

POST: A SUBROUTINE FOR PATH ORDERING OF SABOTAGE TARGETS. (NUREG ; NUREG-CR-1226)
Paper図書
HULME, B.L.(et al.)NUREG (U.S. Nuclear Regulatory Commission)(NUREG (U.S. Nuclear Regulatory Commission))1980.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

Comparison of shortest path algorithms applied to sparse graphs (NUREG ; NUREG/CR-0293) (Wisniewski, J.A.)

Comparison of shortest path algorithms applied to sparse graphs (NUREG ; NUREG/CR-0293) (Wisniewski, J.A.)
Paper図書
Hulme, B.L., Wisniewski, J.A.Sandia Labs.1978.8.
Other Libraries in Japan
  • Author HeadingHulme, B.L.

CODES FOR DIJKSTRA'S SHORTEST PATH ALGORITHM. (SAND ; SAND-78-0493)

CODES FOR DIJKSTRA'S SHORTEST PATH ALGORITHM. (SAND ; SAND-78-0493)
Paper図書
HULME, B.L.(et al.)Sandia National Laboratories(Sandia National Laboratories)1978.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

KSPTH: A SUBROUTINE FOR THE K SHORTEST PATHS IN A SABOTAGE GRAPH. (SAND ; SAND-77-1165)

KSPTH: A SUBROUTINE FOR THE K SHORTEST PATHS IN A SABOTAGE GRAPH. (SAND ; SAND-77-1165)
Paper図書
HULME, B.L.(et al.)Sandia National Laboratories(Sandia National Laboratories)1977.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

MINDPT: A CODE FOR MINIMIZING DETECTION PROBABILITY UP TO A GIVEN TIME AWAY FROM A SABOTAGE TARGET. (SAND ; SAND-77-2039)

MINDPT: A CODE FOR MINIMIZING DETECTION PROBABILITY UP TO A GIVEN TIME AWAY FROM A SABOTAGE TARGET. (SAND ; SAND-77-2039)
Paper図書
HULME, B.L.Sandia National Laboratories(Sandia National Laboratories)1977.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

REGION ADJACENCY GRAPH IN SABOTAGE STUDIES. (SAND ; SAND-76-0574)

REGION ADJACENCY GRAPH IN SABOTAGE STUDIES. (SAND ; SAND-76-0574)
Paper図書
HULME, B.L.Sandia National Laboratories(Sandia National Laboratories)1976.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

PATHFINDING IN GRAPH-THEORETIC SABOTAGE MODELS. I. SIMULTANEOUS ATTACK BY SEVERAL TEAMS. (SAND ; SAND-76-0314)

PATHFINDING IN GRAPH-THEORETIC SABOTAGE MODELS. I. SIMULTANEOUS ATTACK BY SEVERAL TEAMS. (SAND ; SAND-76-0314)
Paper図書
HULME, B.L.Sandia National Laboratories(Sandia National Laboratories)1976.
Other Libraries in Japan
  • Author HeadingHULME, B.L.

GRAPH THEORETIC MODELS OF THEFT PROBLEMS. I. THE BASIC THEFT MODEL. (SAND ; SAND-75-0595)

GRAPH THEORETIC MODELS OF THEFT PROBLEMS. I. THE BASIC THEFT MODEL. (SAND ; SAND-75-0595)
Paper図書
HULME, B.L.Sandia National Laboratories(Sandia National Laboratories)1975.
Other Libraries in Japan
  • Author HeadingHULME, B.L.
RSS