881 search results - page 102 / 177 » Solving satisfiability problems with preferences |
CHES
2010
Springer
13 years 8 months ago
2010
Springer
Measurement errors make power analysis attacks difficult to mount when only a single power trace is available: the statistical methods that make DPA attacks so successful are not a...
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
Many emerging environments are increasingly facing the problem where the requirements of applications easily outstrip the system resources. This is particularly acute in the World...
ICDCS
2009
IEEE
14 years 4 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
CE
2008
13 years 7 months ago
2008
Design patterns have become a widely acknowledged software engineering practice and therefore have been incorporated in the curricula of most computer science departments. This pa...