828 search results - page 31 / 166 » Bounded Hairpin Completion |
SPAA
2009
ACM
14 years 8 days ago
2009
ACM
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
AAAI
2004
13 years 9 months ago
2004
Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeably lacking. T...
AAAI
1998
13 years 9 months ago
1998
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
AAMAS
2007
Springer
13 years 7 months ago
2007
Springer
Abstract – Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeab...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...