Sciweavers

4166 search results - page 205 / 834
» Automating the constraining process
Sort
View
ISPW
2008
IEEE
15 years 9 months ago
Accurate Estimates without Calibration?
Most process models calibrate their internal settings using historical data. Collecting this data is expensive, tedious, and often an incomplete process. Is it possible to make acc...
Tim Menzies, Oussama El-Rawas, Barry W. Boehm, Ray...
DAC
2006
ACM
16 years 4 months ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...
CICLING
2010
Springer
15 years 10 months ago
Quantitative Evaluation of Grammaticality of Summaries
Automated evaluation is crucial in the context of automated text summaries, as is the case with evaluation of any of the language technologies. While the quality of a summary is de...
Ravikiran Vadlapudi, Rahul Katragadda
ICCS
2001
Springer
15 years 7 months ago
An Application of the Process Mechanism to a Room Allocation Problem Using the pCG Language
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
David Benn, Dan Corbett
SAC
2010
ACM
15 years 10 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...