3735 search results - page 216 / 747 » Order compression schemes |
176
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
137
click to vote
GD
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
135
click to vote
ICNP
1996
IEEE
15 years 9 months ago
1996
IEEE
In a wide-area network with high-speed links, congestion may lead to poor utilization and the degradation of the service provided to the users. This paper presents a Cooperative C...
155
click to vote
CCS
2006
ACM
15 years 9 months ago
2006
ACM
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
153
Voted
DAM
2006
15 years 5 months ago
2006
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...