7986 search results - page 152 / 1598 » Computational Science and its Applications |
83
Voted
WG
2010
Springer
14 years 8 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
87
Voted
SAC
2006
ACM
15 years 4 months ago
2006
ACM
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
133
click to vote
IEEESP
2011
14 years 1 months ago
2011
We present a representative development in the science of security that includes a generic model of computer systems, their security properties and adversaries who actively interf...