828 search results - page 31 / 166 » Bounded Hairpin Completion |
SPAA
2009
ACM
15 years 5 months 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...
94
Voted
AAAI
2004
15 years 1 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...
82
Voted
AAAI
1998
15 years 1 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...
87
Voted
AAMAS
2007
Springer
15 years 20 days 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...
94
Voted
CORR
2008
Springer
15 years 19 days 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...