Sciweavers

612 search results - page 70 / 123
» An Empirical Study of Agent Programs
Sort
View
CP
2007
Springer
14 years 3 months ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
AAAI
2008
13 years 11 months ago
Existentially Quantified Values for Queries and Updates of Facts in Transaction Logic Programs
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
Paul Fodor
ICSE
2010
IEEE-ACM
14 years 2 months ago
Developers ask reachability questions
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
Thomas D. LaToza, Brad A. Myers
ISPASS
2010
IEEE
14 years 4 months ago
Dynamic program analysis of Microsoft Windows applications
—Software instrumentation is a powerful and flexible technique for analyzing the dynamic behavior of programs. By inserting extra code in an application, it is possible to study...
Alex Skaletsky, Tevi Devor, Nadav Chachmon, Robert...
JVCA
2002
180views more  JVCA 2002»
13 years 9 months ago
A programming environment for behavioural animation
Behavioural models offer the ability to simulate autonomous agents like organisms and living beings. Psychological studies have showed that the human behaviour can be described by...
Frédéric Devillers, Stéphane ...