Sciweavers

945 search results - page 89 / 189
» Incremental Branching Programs
Sort
View
CP
2008
Springer
13 years 11 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus
ICSE
2010
IEEE-ACM
14 years 1 months ago
LSdiff: a program differencing tool to identify systematic structural differences
Program differencing tools such as GNU diff identify individual differences but do not determine how those differences are related to each other. For example, an extract super...
Alex Loh, Miryung Kim
ICSE
1998
IEEE-ACM
14 years 1 months ago
What You See Is What You Test: A Methodology for Testing Form-Based Visual Programs
Form-based visual programming languages, which include commercial spreadsheets and various research systems, have had a substantial impact on end-user computing. Research shows, h...
Gregg Rothermel, Lixin Li, Christopher DuPuis, Mar...
WSC
2004
13 years 10 months ago
Simulation Model of the Telemedicine Program
The Telemedicine Program was created to provide medical assistance to people living in extreme poverty conditions in Mexico. Through a satellite connection, a physician located in...
Juan Mauricio Lach, Ricardo Manuel Vázquez
SIGMOD
2012
ACM
234views Database» more  SIGMOD 2012»
11 years 11 months ago
BloomUnit: declarative testing for distributed programs
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
Peter Alvaro, Andrew Hutchinson, Neil Conway, Will...