6693 search results - page 118 / 1339 » On an anytime algorithm for control |
AI
2006
Springer
14 years 10 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
PUC
2007
14 years 9 months ago
2007
Personal experience computing is an emerging research area in computing support for capturing, archiving, editing, and utilizing of digital personal experiences. This paper presen...
RSP
1999
IEEE
15 years 2 months ago
1999
IEEE
A platform and methodology for real time systems on chip prototyping is presented. The JPEG case study is presented as an example of prototyping. The proposed methodology overcome...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
ICTAI
1999
IEEE
15 years 2 months ago
1999
IEEE
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...