Sciweavers

8413 search results - page 1036 / 1683
» Ordering Problem Subgoals
Sort
View
AAAI
2008
15 years 9 months ago
Reinforcement Learning for Vulnerability Assessment in Peer-to-Peer Networks
Proactive assessment of computer-network vulnerability to unknown future attacks is an important but unsolved computer security problem where AI techniques have significant impact...
Scott Dejmal, Alan Fern, Thinh Nguyen
AIPS
2007
15 years 9 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
FLAIRS
2008
15 years 9 months ago
A New Approach to Heuristic Estimations for Cost-Based Planning
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
Raquel Fuentetaja, Daniel Borrajo, Carlos Linares ...
ASPDAC
2008
ACM
104views Hardware» more  ASPDAC 2008»
15 years 9 months ago
Low power clock buffer planning methodology in F-D placement for large scale circuit design
Traditionally, clock network layout is performed after cell placement. Such methodology is facing a serious problem in nanometer IC designs where people tend to use huge clock buff...
Yanfeng Wang, Qiang Zhou, Yici Cai, Jiang Hu, Xian...
ATAL
2008
Springer
15 years 9 months ago
Cost-based BDI plan selection for change propagation
Software maintenance is responsible for as much as two thirds of the cost of any software, and is consequently an important research area. In this paper we focus on the change pro...
Khanh Hoa Dam, Michael Winikoff
« Prev « First page 1036 / 1683 Last » Next »