5316 search results - page 982 / 1064 » Which Search Problems Are Random |
164
click to vote
OPODIS
2003
15 years 4 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
124
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...
125
click to vote
EOR
2008
15 years 3 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
125
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
146
Voted
VIROLOGY
2010
15 years 1 months ago
2010
Abstract. This paper gives an overview of our research in the automation of the process of software protection analysis. We will focus more particularly on the problem of obfuscati...