Sciweavers

945 search results - page 13 / 189
» Incremental Branching Programs
Sort
View
IPCO
2007
87views Optimization» more  IPCO 2007»
13 years 9 months ago
On Integer Programming and the Branch-Width of the Constraint Matrix
Consider an integer program max(ct x : Ax = b, x ≥ 0, x ∈ Zn ) where A ∈ Zm×n , b ∈ Zm , and c ∈ Zn . We show that the integer program can be solved in pseudo-polynomial...
William H. Cunningham, Jim Geelen
CPAIOR
2005
Springer
14 years 1 months ago
Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price
Producing work schedules for airline crew normally results in individually different schedules. Some airlines do however want to give the same schedule to groups of people. The con...
Jesper Hansen, Tomas Lidén
JSS
2010
107views more  JSS 2010»
13 years 6 months ago
An empirical investigation into branch coverage for C programs using CUTE and AUSTIN
Automated test data generation has remained a topic of considerable interest for several decades because it lies at the heart of attempts to automate the process of Software Testi...
Kiran Lakhotia, Phil McMinn, Mark Harman
PLDI
2005
ACM
14 years 1 months ago
Code placement for improving dynamic branch prediction accuracy
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...
Daniel A. Jiménez