Sciweavers

774 search results - page 52 / 155
» Process Discovery Using Integer Linear Programming
Sort
View
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 10 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
DCC
2011
IEEE
13 years 5 months ago
Some observations on HC-128
In this paper, we use linear approximations of the addition modulo 2n of three n-bit integers to identify linear approximations of g1, g2, the feedback functions of HC-128. This, i...
Subhamoy Maitra, Goutam Paul, Shashwat Raizada, Su...
IOR
2008
109views more  IOR 2008»
13 years 10 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
14 years 2 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
ACL
2008
13 years 11 months ago
Enforcing Transitivity in Coreference Resolution
A desirable quality of a coreference resolution system is the ability to handle transitivity constraints, such that even if it places high likelihood on a particular mention being...
Jenny Rose Finkel, Christopher D. Manning