Sciweavers

2192 search results - page 195 / 439
» Algorithms for Challenging Motif Problems
Sort
View
GECCO
2009
Springer
175views Optimization» more  GECCO 2009»
15 years 9 months ago
Evolving soft robotic locomotion in PhysX
Given the complexity of the problem, genetic algorithms are one of the more promising methods of discovering control schemes for soft robotics. Since physically embodied evolution...
John Rieffel, Frank Saunders, Shilpa Nadimpalli, H...
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
15 years 9 months ago
A viewpoint-based approach for interaction graph analysis
Recent innovations have resulted in a plethora of social applications on the Web, such as blogs, social networks, and community photo and video sharing applications. Such applicat...
Sitaram Asur, Srinivasan Parthasarathy
ICC
2007
IEEE
154views Communications» more  ICC 2007»
15 years 8 months ago
Topology Management in CogMesh: A Cluster-Based Cognitive Radio Mesh Network
As the radio spectrum usage paradigm shifting from the traditional command and control allocation scheme to the open spectrum allocation scheme, wireless mesh networks meet new opp...
Tao Chen, Honggang Zhang, Gian Mario Maggio, Imric...
BIOSURVEILLANCE
2008
Springer
15 years 6 months ago
Integrating a Commuting Model with the Bayesian Aerosol Release Detector
The Bayesian Aerosol Release Detector (BARD) is a biosurveillance system for detecting and characterizing disease outbreaks caused by aerosol releases of anthrax. A major challenge...
Aurel Cami, Garrick L. Wallstrom, William R. Hogan
C3S2E
2010
ACM
15 years 5 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire