Sciweavers

870 search results - page 1 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
ATAL
2008
Springer
13 years 6 months ago
Theoretical and experimental results on the goal-plan tree problem
Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is...
Patricia H. Shaw, Berndt Farwer, Rafael H. Bordini
IPL
2002
119views more  IPL 2002»
13 years 4 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
PPSN
2004
Springer
13 years 10 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
ICTAI
1999
IEEE
13 years 9 months ago
Controlled Flux Results in Stable Decision Trees
This work deals with stability in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and oscillat...
Dimitrios Kalles, Athanassios Papagelis
JSAT
2008
122views more  JSAT 2008»
13 years 4 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