5356 search results - page 840 / 1072 » Adventures in time and space |
119
Voted
SARA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
110
Voted
COCOON
2001
Springer
15 years 6 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
105
click to vote
IEAAIE
2001
Springer
15 years 6 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
122
click to vote
NOSSDAV
2001
Springer
15 years 6 months ago
2001
Springer
Operating system enhancements to support real-time and multimedia applications often include specializations and extensions of kernel functionality, as with the kernel HTTP daemon...