16404 search results - page 2656 / 3281 » A set coverage problem |
196
click to vote
COMPULOG
1999
Springer
15 years 11 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
196
click to vote
ISCAS
1999
IEEE
15 years 11 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
186
click to vote
CP
1999
Springer
15 years 11 months ago
1999
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
155
click to vote
IWPC
1999
IEEE
15 years 11 months ago
1999
IEEE
One of the fundamental problems with the static analysis of binary (executable) code is that7 of recognizing, in a machine-independent way, the target addresses of n-conditional b...
215
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...