Now showing items 1726-1745 of 1766

    • Valid Inequalities for the Pooling Problem with Binary Variables 

      D'Ambrosio, Claudio; Linderoth, Jeff; Luedtke, James (University of Wisconsin-Madison Department of Computer Sciences, 2010)
      The pooling problem consists of finding the optimal quantity of final products to obtain by blending different compositions of raw materials in pools. Bilinear terms are required to model the quality of products in the ...
    • Validating Library Usage Interactively 

      Jha, Somesh; Lu, Shan; Jin, Guoliang; Harris, William R. (2013-01-28)
      Programmers who develop large, mature applications often want to optimize the performance of their program without changing the semantics of the program. They often do so by changing how their program invokes a library ...
    • The Validity of a Family of Optimization Methods 

      Meyer, Robert R. (University of Wisconsin-Madison Department of Computer Sciences, 1968)
      A family of iterative optimization methods, which includes most of the well-known algorithms of mathematical programming, is described and analyzed with respect to the properties of its accumulation points. It is shown ...
    • Value-Based Scheduling in Real-Time Database Systems 

      Haritsa, Jayant R; Carey, Michael J; Livny, Miron (University of Wisconsin-Madison Department of Computer Sciences, 1991)
    • A Variable-Complexity Norm Maximization Problem 

      Mangasarian, Olvi L; Shiau, Tzong-Huei (University of Wisconsin-Madison Department of Computer Sciences, 1984)
    • Verification of Network Management System Configurations 

      Cohrs, David L; Miller, Barton P (University of Wisconsin-Madison Department of Computer Sciences, 1990)
    • Verification of Process Structures of Interacting Digital Systems 

      Johnson, R.T.; Fitzwater, D.R. (University of Wisconsin-Madison Department of Computer Sciences, 1973)
      A formal, universe for systems design has been developed, in which representations of interacting digital, systems are interpreted by a deterministic automaton acting on state information in the form of character strings. ...
    • Verifying Concurrent Message-Passing C Programs with Recursive Calls 

      Chaki, Sagar; Clarke, Edmund; Kidd, Nicholas; Reps, Thomas; Touili, Tayssir (University of Wisconsin-Madison Department of Computer Sciences, 2005)
      We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We ...
    • Verifying Concurrent Programs via Bounded Context-Switching and Induction 

      Prabhu, Prathmesh; Reps, Thomas; Lal, Akash; Kidd, Nicholas (University of Wisconsin-Madison Department of Computer Sciences, 2011)
      This paper presents a new approach to the problem of verifying safety properties of concurrent programs with shared memory and interleaving semantics. The method described leverages recent work on context-bounded analysis ...
    • Verifying File System Properties with Type Inference 

      Gunawi, Haryadi S.; Krishnan, Shweta (University of Wisconsin-Madison Department of Computer Sciences, 2011)
      The storage stack is not trustworthy due to errors that arise from a variety of sources: unreliable hardware, malicious errors and file system bugs. Today, software errors play a dominant role due to their inherent ...
    • Verifying Information Flow Control Over Unbounded Processes 

      Harris, William; Kidd, Nicholas; Chaki, Sagar; Jha, Somesh; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2009)
      Decentralized Information Flow Control (DIFC) systems enable programmers to express a desired DIFC policy, and to have the policy enforced via a reference monitor that restricts interactions between system objects, such ...
    • Viewpoint from Occluding Contour 

      Seales, W Brent; Dyer, Charles R (University of Wisconsin-Madison Department of Computer Sciences, 1990)
    • Visibility, Occlusion, and the Aspect Graph 

      Plantinga, William H; Dyer, Charles R (University of Wisconsin-Madison Department of Computer Sciences, 1987)
    • Vision-Guided Exploration: A Step Toward General Motion Planning in Three Dimensions 

      Kutulakos, Kiriakos N; Dyer, Charles R; Lumelsky, Vladimir J (University of Wisconsin-Madison Department of Computer Sciences, 1992)
    • Visualizing Scientific Computations: A System Based on Lattice-Structured Data and Display Models 

      Hibbard, William L (University of Wisconsin-Madison Department of Computer Sciences, 1995)
    • WALi: Nested-Word Automata 

      Driscoll, Evan; Thakur, Aditya; Burton, Amanda; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2011)
      WALi-NWA is a C++ library for constructing, querying, and operating on nested-word automata. It is a portion of the WALi library, which provides types and operations for weighted automata. While the NWA portions of WALi ...
    • Weak Ordering - A New Definition and Some Implications 

      Adve, Sarita V; Hill, Mark D (University of Wisconsin-Madison Department of Computer Sciences, 1989)
      A model for correct program behavior commonly and often implicitly assumed by programmers is that of sequential consistency, which guarantees that all memory accesses execute atomically and in program order. An alternative ...
    • Weak Sharp Minima and Exact Penalty Functions 

      Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1988)
    • Weak Sharp Minima in Mathematical Programming 

      Burke, JV; Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1991)
    • Weighted Pushdown Systems and Their Applications to Interprocedural Dataflow Analysis 

      Reps, Thomas; Schwoon, Stefan; Jha, Somesh (University of Wisconsin-Madison Department of Computer Sciences, 2003)
      Recently, pushdown systems (PDSs) have been extended to weighted PDSs, in which each transition is labeled with a value, and the goal is to determine the meet-over-all-paths value (for paths that meet a certain criterion). ...