Sciweavers

1154 search results - page 223 / 231
» Mathematizing C concurrency
Sort
View
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
13 years 8 months ago
Using differential evolution for symbolic regression and numerical constant creation
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
Brian M. Cerny, Peter C. Nelson, Chi Zhou
MOBICOM
2010
ACM
13 years 8 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
AI
2010
Springer
13 years 7 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
AMAI
2008
Springer
13 years 7 months ago
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
Patrick Amstutz, Nikolaus Correll, Alcherio Martin...
BMCBI
2010
154views more  BMCBI 2010»
13 years 7 months ago
Motif Enrichment Analysis: a unified framework and an evaluation on ChIP data
Background: A major goal of molecular biology is determining the mechanisms that control the transcription of genes. Motif Enrichment Analysis (MEA) seeks to determine which DNA-b...
Robert C. McLeay, Timothy L. Bailey