297 search results - page 17 / 60 » Towards a Parallel Search for Solutions of Non-deterministic... |
FLAIRS
2008
13 years 10 months ago
2008
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
IMC
2004
ACM
14 years 1 months ago
2004
ACM
The capacity of today's network links, along with the heterogeneity of their traffic, is rapidly growing, more than the workstation’s processing power. This makes the task ...
ICS
2009
Tsinghua U.
14 years 3 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
ICLP
2001
Springer
14 years 26 days ago
2001
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...