Sciweavers

716 search results - page 42 / 144
» Semilinear Program Feasibility
Sort
View
ACMSE
2004
ACM
15 years 3 months ago
Specification-driven automated testing of GUI-based Java programs
This paper presents a specification-driven approach to test automation for GUI-based JAVA programs as an alternative to the use of capture/replay. The NetBeans Jemmy library provi...
Yanhong Sun, Edward L. Jones
IOR
2006
177views more  IOR 2006»
14 years 9 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
MOR
2002
94views more  MOR 2002»
14 years 9 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
UPP
2004
Springer
15 years 3 months ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner
ICCAD
1999
IEEE
86views Hardware» more  ICCAD 1999»
15 years 2 months ago
Clock skew scheduling for improved reliability via quadratic programming
This paper considers the problem of determining an optimal clock skew schedule for a synchronous VLSI circuit. A novel formulation of clock skew scheduling as a constrained quadrat...
Ivan S. Kourtev, Eby G. Friedman