Sciweavers

147 search results - page 5 / 30
» Describing Problem Solving Methods using Anytime Performance...
Sort
View
AIPS
2008
13 years 10 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
CASES
2007
ACM
13 years 11 months ago
Performance optimal processor throttling under thermal constraints
We derive analytically, the performance optimal throttling curve for a processor under thermal constraints for a given task sequence. We found that keeping the chip temperature co...
Ravishankar Rao, Sarma B. K. Vrudhula
ECAI
1990
Springer
13 years 11 months ago
Knowledge-Intensive Case-Based Reasoning and Sustained Learning
In case-based reasoning (CBR) a problem is solved by matching the problem description to a previously solved case, using the past solution in solving the new problem. A case-based...
Agnar Aamodt
GECCO
2005
Springer
157views Optimization» more  GECCO 2005»
14 years 1 months ago
Simple addition of ranking method for constrained optimization in evolutionary algorithms
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...
Pei Yee Ho, Kazuyuki Shimizu
AAAI
2000
13 years 9 months ago
Towards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
Raul Trejo, Vladik Kreinovich, Chitta Baral