Sciweavers

276 search results - page 45 / 56
» Abstraction and Refinement for Local Reasoning
Sort
View
EWSN
2009
Springer
14 years 9 months ago
MVSink: Incrementally Building In-Network Aggregation Trees
Abstract. In-network data aggregation is widely recognized as an acceptable means to reduce the amount of transmitted data without adversely affecting the quality of the results. T...
Leonardo L. Fernandes, Amy L. Murphy
LICS
2009
IEEE
14 years 3 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 8 months ago
How to use the Scuba Diving metaphor to solve problem with neutrality ?
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
Philippe Collard, Sébastien Vérel, M...
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 3 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
APLAS
2007
ACM
14 years 22 days ago
Scalable Simulation of Cellular Signaling Networks
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
Vincent Danos, Jérôme Feret, Walter F...