2645 search results - page 145 / 529 » time 2003 |
174
click to vote
ISAAC
2003
Springer
16 years 3 days ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
181
click to vote
ISCAS
2003
IEEE
16 years 6 days ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
186
click to vote
CP
2003
Springer
16 years 5 days ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
135
click to vote
ICDCS
2003
IEEE
16 years 6 days ago
2003
IEEE
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
186
click to vote
IPPS
2003
IEEE
16 years 6 days ago
2003
IEEE
MCT is a widely used heuristic for scheduling tasks onto grid platforms. However, when dealing with many tasks, MCT tends to dramatically delay already mapped task completion time...