Sciweavers

228 search results - page 45 / 46
» Knot planning from observation
Sort
View
IJCAI
2003
13 years 8 months ago
Temporal Reasoning with Preferences and Uncertainty
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
Neil Yorke-Smith, Kristen Brent Venable, Francesca...
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
AEI
2004
87views more  AEI 2004»
13 years 7 months ago
Estimating the productivity of cyclic construction operations using case-based reasoning
The estimation of productivity rates in cyclic construction processes is a difficult, but essential task in the planning of construction projects. The conventional method--a calcu...
Darren Graham, Simon D. Smith
CSMR
2010
IEEE
13 years 2 months ago
Does the Past Say It All? Using History to Predict Change Sets in a CMDB
To avoid unnecessary maintenance costs in large IT systems resulting from poorly planned changes, it is essential to manage and control changes to the system and to verify that all...
Sarah Nadi, Richard C. Holt, Serge Mankovski
PROMISE
2010
13 years 2 months ago
Better, faster, and cheaper: what is better software?
Background: Defects are related to failures and they do not have much power for indicating a higher quality or a better system above the baseline that the end-users expect. Nevert...
Burak Turhan, Çetin Meriçli, Tekin M...