Sciweavers

1450 search results - page 200 / 290
» On the Complexity of Hardness Amplification
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 2 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
14 years 2 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
COMPSAC
1998
IEEE
14 years 1 months ago
Architecture of ROAFTS/Solaris: A Solaris-Based Middleware for Real-Time Object-Oriented Adaptive Fault Tolerance Support
Middleware implementation of various critical services required by large-scale and complex real-time applications on top of COTS operating system is currently an approach of growi...
Eltefaat Shokri, Patrick Crane, K. H. Kim, Chittur...
ISER
1993
Springer
123views Robotics» more  ISER 1993»
14 years 1 months ago
Mobile Robot Miniaturisation: A Tool for Investigation in Control Algorithms
The interaction of an autonomous mobile robot with the real world critically depends on the robots morphology and on its environment. Building a model of these aspects is extremel...
Francesco Mondada, Edoardo Franzi, Paolo Ienne
ANCS
2007
ACM
14 years 1 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos