Sciweavers

5802 search results - page 1151 / 1161
» Parallelizing Feature Selection
Sort
View
POPL
1989
ACM
14 years 1 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
CAV
2010
Springer
194views Hardware» more  CAV 2010»
14 years 1 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber
FDL
2007
IEEE
14 years 1 months ago
Transaction Level Modelling: A reflection on what TLM is and how TLMs may be classified
Transaction-level modelling (TLM) is a poorlyterm, promising a level of abstraction like RTL (register transfer level), where the key feature is a `transaction'. But unlike r...
Mark Burton, James Aldis, Robert Günzel, Wolf...
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 1 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
CCS
2006
ACM
14 years 1 months ago
Doppelganger: Better browser privacy without the bother
We introduce Doppelganger, a novel system for creating and enforcing fine-grained, privacy preserving browser cookie policies with low manual effort. Browser cookies pose privacy ...
Umesh Shankar, Chris Karlof
« Prev « First page 1151 / 1161 Last » Next »