Sciweavers

460 search results - page 22 / 92
» RTL-Datapath Verification using Integer Linear Programming
Sort
View
EACL
2009
ACL Anthology
13 years 5 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 7 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 7 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
JAMDS
2002
65views more  JAMDS 2002»
13 years 7 months ago
Optimum workforce scheduling under the (14, 21) days-off timetable
Abstract. An efficient optimum solution is presented for a real-life employee daysoff scheduling problem with a three-week cycle. Over a given work cycle, each worker is given 14 s...
Hesham K. Alfares
ICST
2009
IEEE
13 years 5 months ago
Euclide: A Constraint-Based Testing Framework for Critical C Programs
Euclide is a new Constraint-Based Testing tool for verifying safety-critical C programs. By using a mixture of symbolic and numerical analyses (namely static single assignment for...
Arnaud Gotlieb