Sciweavers

136 search results - page 26 / 28
» A Polynomial-Time Algorithm for Global Value Numbering
Sort
View
BIBE
2006
IEEE
135views Bioinformatics» more  BIBE 2006»
14 years 3 months ago
Evidence of Multiple Maximum Likelihood Points for a Phylogenetic Tree
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...
Bing Bing Zhou, Monther Tarawneh, Pinghao Wang, Da...
SOFTVIS
2010
ACM
13 years 10 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
IPSN
2004
Springer
14 years 3 months ago
Distributed optimization in sensor networks
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
Michael Rabbat, Robert D. Nowak
WWW
2004
ACM
14 years 10 months ago
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
Min Cai, Martin R. Frank
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 3 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...