406 search results - page 79 / 82 » Boosting Using Branching Programs |
AI
2010
Springer
13 years 8 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
JCIT
2007
13 years 8 months ago
2007
In this paper, we outline a framework for the development of natural language interfaces to agent systems with a focus on action representation. The architecture comprises a natur...
LOGCOM
1998
13 years 8 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
ISCA
2002
IEEE
13 years 8 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
SIGSOFT
2006
ACM
14 years 9 months ago
2006
ACM
Recent software systems usually feature an automated failure reporting system, with which a huge number of failing traces are collected every day. In order to prioritize fault dia...