1511 search results - page 107 / 303 » On the effectiveness of address-space randomization |
KI
1999
Springer
14 years 6 days ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
TREC
2004
13 years 9 months ago
2004
With our participation in TREC2004, we test Terrier, a modular and scalable Information Retrieval framework, in three tracks. For the mixed query task of the Web track, we employ ...
IJIEM
2006
13 years 8 months ago
2006
: In our analysis of e-political participation among a 2003-random sample survey of 478 respondents drawn from Iowa, Pennsylvania and Colorado, six blocks of variables were entered...