Sciweavers

7167 search results - page 266 / 1434
» Answer Set Programming
Sort
View
IPPS
2007
IEEE
15 years 8 months ago
ExPert: Dynamic Analysis Based Fault Location via Execution Perturbations
We are designing dynamic analysis techniques to identify executed program statements where a fault lies, i.e. the fault candidate set. To narrow the set of statements in the fault...
Neelam Gupta, Rajiv Gupta
130
Voted
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 7 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
140
Voted
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 2 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
121
Voted
ERSHOV
2009
Springer
15 years 9 months ago
Symbolic Bounded Conformance Checking of Model Programs
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
Margus Veanes, Nikolaj Bjørner
122
Voted
EOR
2006
104views more  EOR 2006»
15 years 2 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve